How to Find DFS Preorder and DFS Postorder for a Graph

array(10) { [0]=> object(stdClass)#4279 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "_IhTp8q0Mm0" ["related_video_title"]=> string(70) "Tree traversal algorithms (BFS and DFS - Preorder, Inorder, Postorder)" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(10) "CodeBeauty" } [1]=> object(stdClass)#4252 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "RnHC1XiNWS8" ["related_video_title"]=> string(94) "Венедиктов – страх, Симоньян, компромиссы / вДудь" ["posted_time"]=> string(21) "5 дней назад" ["channelName"]=> string(10) "вДудь" } [2]=> object(stdClass)#4277 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "PMMc4VsIacU" ["related_video_title"]=> string(65) "Depth First Search (DFS) Explained: Algorithm, Examples, and Code" ["posted_time"]=> string(21) "4 года назад" ["channelName"]=> string(9) "Reducible" } [3]=> object(stdClass)#4284 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "pcKY4hjDrxk" ["related_video_title"]=> string(81) "5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search" ["posted_time"]=> string(19) "7 лет назад" ["channelName"]=> string(10) "Abdul Bari" } [4]=> object(stdClass)#4263 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "cmumKXfSuAw" ["related_video_title"]=> string(42) "Graph Searching 5 Performing DFS by Hand" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(17) "Professor Painter" } [5]=> object(stdClass)#4281 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "TIbUeeksXcI" ["related_video_title"]=> string(87) "Depth First & Breadth First Graph Search - DFS & BFS Graph Searching Algorithms" ["posted_time"]=> string(19) "6 лет назад" ["channelName"]=> string(16) "Back To Back SWE" } [6]=> object(stdClass)#4276 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "blWdjRUPP6E" ["related_video_title"]=> string(72) "Разведчик о том, как использовать людей" ["posted_time"]=> string(25) "2 недели назад" ["channelName"]=> string(18) "Коллектив" } [7]=> object(stdClass)#4286 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "GX01Lh2IU68" ["related_video_title"]=> string(113) "ОТКУДА В АНГЛИЙСКОМ СТОЛЬКО КОСЯКОВ - и как понять исключения?" ["posted_time"]=> string(21) "5 дней назад" ["channelName"]=> string(36) "Virginia Bēowulf · English Studies" } [8]=> object(stdClass)#4262 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "7XVTnCrWDPY" ["related_video_title"]=> string(50) "Graph Search Visualization in Python (BFS and DFS)" ["posted_time"]=> string(19) "1 год назад" ["channelName"]=> string(10) "NeuralNine" } [9]=> object(stdClass)#4280 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "7Z85mPcb770" ["related_video_title"]=> string(98) "Острый дефицит бронетехники в армии РФ. Руслан Левиев" ["posted_time"]=> string(23) "6 часов назад" ["channelName"]=> string(18) "The Breakfast Show" } }