How can I find better fashion options for this search?
Use related searches, refine your keywords by style or occasion, and compare multiple product cards before opening store pages.
Bfs And Dfs Algorithm Python
120 results discovered for Bfs And Dfs Algorithm Python. Refine by style, occasion, or category to find more relevant fashion products.
Debug Information
Array
(
[meilisearch] => Array
(
[url] => https://msin.fadunews.in/indexes/zipri/search
[http_code] => 200
[response] => {"hits":[],"query":"Bfs-And-Dfs-Algorithm-Python","processingTimeMs":0,"limit":3,"offset":0,"estimatedTotalHits":0}
[curl_error] =>
[parsed] => Array
(
[hits] => Array
(
)
[query] => Bfs-And-Dfs-Algorithm-Python
[processingTimeMs] => 0
[limit] => 3
[offset] => 0
[estimatedTotalHits] => 0
)
)
[image_search] => Array
(
[url] => http://206.189.178.169:3001/?freshness=All&show=1&q=Bfs-And-Dfs-Algorithm-Python+INR+loc%3Ain
[http_code] => 200
[response] => {"name":"bfs-and-dfs-algorithm-python inr loc:in","totalEstimatedMatches":160,"nextOffset":120,"currentOffset":0,"value":{"043D0000750F21D035354C9A0BFF77ED2A6095C8":{"name":"Practical 1 - SSXS: Implementing DFS & BFS Algorithms in Python - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.xvZEJep5_wF-Oo82Jl5qNQHaKd?pid=Api","datePublished":"2025-09-22T20:40:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/c1d1cb5f5682d68c0b80e12411624a5b/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-mumbai/tybsc-physics-mathematical-methods-in-physics/practical-1-ssxs-implementing-dfs-bfs-algorithms-in-python/139277905","contentSize":"291373 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.c6f64425ea79ff017e3a8f36265e6a35?rik=QNMAAFfwEg1TUw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"8C5906A2DE77FFB0A9C453530D12F0570000D340","accentColor":"2F2F2F"},"6612559C54AD0FCEC706150F749E48AB5D2E06FB":{"name":"Experiment No1 and 2: Implementing BFS and DFS Algorithms in Python ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.e8XdK-aQ0fZerJ9wXyEpmwHaJl?pid=Api","datePublished":"2025-05-05T00:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/c850189c29d3a0c5644b56eb77dafe28/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/jawaharlal-nehru-technological-university-hyderabad-college-of-engineering-sultanpur/computer-science-and-engineering/experiment-no1-and-2-implementing-bfs-and-dfs-algorithms-in-python/125361400","contentSize":"402400 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.7bc5dd2be690d1f65eac9f705f21299b?rik=ZiFVyUXa8Ox8YA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"BF60E2D5BA84E947F051607CECF0DA45C9552166","accentColor":"B0561B"},"EB478C1657FF83F9BFB1E34379BD674DECEB38A9":{"name":"AI Lab Manual: BFS & DFS Algorithms with Python Implementations - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.2Ta7IDj5sTg6RGQu4Sn9HQHaJl?pid=Api","datePublished":"2026-02-06T11:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/627ec2ef8b569560a6007e53ee3c0900/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/teegala-krishna-reddy-engineering-college/computer-science-engineering/ai-lab-manual-bfs-dfs-algorithms-with-python-implementations/152870286","contentSize":"142305 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.d936bb2038f9b1383a44642ee129fd1d?rik=vnTIYXX%2fOJ%2f7Gw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9A83BECED476DB97343E1BFB9F38FF7561C874BE","accentColor":"454545"},"5B65FE59B524CD2354FFD63CD178548A18E12FBF":{"name":"Implement DFS and BFS Search Algorithm - 1. Implement DFS and BFS ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.aHdlKoMlDeiJons4PpnmhgHaJl?pid=Api","datePublished":"2024-05-16T18:36:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/1c65db5fcb18b31dac132c0a144e22b8/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/dr-ambedkar-institute-of-technology/electronics-engineering/implement-dfs-and-bfs-search-algorithm/93621408","contentSize":"69775 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.6877652a83250de889a27b383e99e686?rik=tVbvlVtC3DJF%2fw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"FBF21E81A845871DC36DFF4532DC425B95EF56B5","accentColor":"484848"},"0A9ED709DCA2C8B74A0E1C5B12C569E182AF488F":{"name":"BFS AND DFS Comparison IN DATA Structures - BFS vs. DFS Before looking ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.0MyonPjzZG0Kpg_qPJABSAHaKe?pid=Api","datePublished":"2022-06-25T06:41:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/ed0dc8092aee1305883f01e0a3475f37/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/btech/bfs-and-dfs-comparison-in-data-structures/22769251","contentSize":"225725 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.d0cca89cf8f3646d0aa60fea3c900148?rik=oOl9kM0qjHuk4A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F884FA281E965C21B5C1E0A47B8C2ACD907DE9A0","accentColor":"850B0B"},"006C266EBD5C1716D289B0795796949CCE53C304":{"name":"DFS vs. BFS: A Student’s Guide to Graph Traversal Algorithms","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.tzeWd514hbtYvHT441YMnwHaEK?pid=Api","datePublished":"2025-11-28T06:53:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.lingayasvidyapeeth.edu.in/sanmax/wp-content/uploads/2025/11/DFS-vs.-BFS.webp","hostPageUrl":"https://www.lingayasvidyapeeth.edu.in/dfs-vs-bfs-a-students/","contentSize":"123276 B","width":1200,"height":675,"cDNContentUrl":"https://th.bing.com/th/id/R.b73796779d7885bb58bc74f8e3560c9f?rik=AMZi5tvFcWEtmA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"403C35ECC9496975970B982D6171C5DBE662C600","accentColor":"0048AC"},"6A8EF70896806BBF6A6D230AA42D41A3BD0B926C":{"name":"AI Practical File: Search Algorithms (BFS, DFS, A*) Experiments - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.3ZCA-r3PDZI_7UkHZn1UmgHaJl?pid=Api","datePublished":"2025-06-10T19:38:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/3e1fc220c0eefebe780efa95bbd684ed/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/the-oxford-educational-institutions/healing-her-heart/ai-practical-file-search-algorithms-bfs-dfs-a-experiments/129257123","contentSize":"210971 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.dd9080fabdcf0d923fed4907667d549a?rik=puh%2fgGkItvum1g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C629B0DB3A14D24AA032D6A6FBB60869807FE8A6","accentColor":"3F638C"},"D466BD06D592C13AB78A8D448B07B1017DA35D1C":{"name":"AI Practical No. 2: Implementing BFS & DFS Search Algorithms - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.dS5mcNF4Ksdh9uQQQUw8FgHaKd?pid=Api","datePublished":"2025-07-08T00:41:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/1881ff7817b9b754e6e384f9f58996d9/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/artificial-intelligence-and-data-sciencecomputer-science-and-engineeringartificial-intelligence/ai-practical-no-2-implementing-bfs-dfs-search-algorithms/132881136","contentSize":"439668 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.752e6670d1782ac761f6e410414c3c16?rik=TWbbYF0pHKN7qA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C1D53AD7101B70B844D8A87BA31C295D60DB664D","accentColor":"C2A909"},"57EE0FAA071532C7694DBA6F7E18994902A9644F":{"name":"Explain DFS and BFS with example | summer-2014","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.OvEFQpvcxXUSh-89DWaN9AAAAA?pid=Api","datePublished":"2020-12-26T17:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://gtu-paper-solution.com/upload/2130702/S2019/DFS_Example.png","hostPageUrl":"https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2014/Question-4-a","contentSize":"24185 B","width":406,"height":230,"cDNContentUrl":"https://th.bing.com/th/id/R.3af105429bdcc5751287ef3d0d668df4?rik=de7wqnBRI3yW1A&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fDFS_Example.png&ehk=azueXLkfjIxbKuTR1P6uchitrSbBRy1RK2xVFdJ7UKs%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F4469A20949981E7F6ABD4967C235170AAF0EE75","accentColor":"9A6C31"},"D0541B5E2CB79DEFC6D17207F792F82723157C04":{"name":"AI E1 - Experiment 1: Implementing BFS, DFS, and Logic Gates in Python ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.4XWNkgGn5WaQi52X7FQinAHaKd?pid=Api","datePublished":"2025-04-09T16:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/99397dfedd3cba1b658f988882747151/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/amity-university/artificial-intelligence/ai-e1-experiment-1-implementing-bfs-dfs-and-logic-gates-in-python/123321865","contentSize":"188258 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.e1758d9201a7e566908b9d97ec54229c?rik=DUWx5cJ72f5sHQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"40C75132728F297F70271D6CFED97BC2E5B1450D","accentColor":"494949"},"AE2A68C7D0C1E3C00460ADF9E8B4DC3A2EE03252":{"name":"Graph Algorithms: DFS and BFS Overview (CS101 Lecture Notes) - Studocu","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.MUcQsG5_eXB0Ro-jesVZqgHaJl?pid=Api","datePublished":"2026-01-29T02:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/a338a5b9674d2c7c4f2cfa2d486d2180/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/abes-engineering-college/machine-learning-techniques/graph-algorithms-dfs-and-bfs-overview-cs101-lecture-notes/152115128","contentSize":"183107 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.314710b06e7f797074468fa37ac559aa?rik=6qKGfA0cPgxABg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"25230EE2A3CD4B8E9FDA06400C3E1C0D7C86A2EA","accentColor":"C99602"},"26EA38F78CC013694AF86A66997B209B508DDF68":{"name":"Search Algorithms in AI (Lab) - BFS, DFS, UCS, and More - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.bbbHU60mje7vNPDuTbyBiwHaKe?pid=Api","datePublished":"2026-02-09T17:13:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/2724aab7db950f478af5a507fc61b3dc/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/kalinga-institute-of-industrial-technology/python-programming-lab/search-algorithms-in-ai-lab-bfs-dfs-ucs-and-more/153015136","contentSize":"1128301 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.6db6c753ad268deeef34f0ee4dbc818b?rik=Yq6Df8gMMZakjw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"86FDD805B902B79966A68FA496310CC87F83AE62","accentColor":"137B6E"},"4098B576B2CDDFDFBAB2420C505833B68B676A3C":{"name":"Python Ass3-BFS-DFS - Python program to print DFS traversal from a ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.Xt7eSEtATey86U0C5M_7FQHaJl?pid=Api","datePublished":"2023-02-17T11:05:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/fdefe55d2a0db24043652868df405854/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/msccomputer-science/python-ass3-bfs-dfs/47289375","contentSize":"121751 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.5edede484b404decbce94d02e4cffb15?rik=BIlbZyvc%2ff2rKw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C3A676B86B338505C0242BABFDFDDC2B675B8904","accentColor":"414141"},"0560B7BE2C1A49A7CF274EF52696E0F10C3AEF9F":{"name":"BFS Algorithm and DFS algorithm Assignment - Data Analysis - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.hRq-npEVvnaPEx-v7tYGEgHaJl?pid=Api","datePublished":"2022-02-07T22:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/0c45435860c01e17ab18e75a7ae1b11c/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/amity-university/data-analysis/bfs-algorithm-and-dfs-algorithm-assignment/19465350","contentSize":"162847 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.851abe9e9115be768f131fafeed60612?rik=UAZ768KhlHr8cg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F9FEA3C01F0E69625FE472FC7A94A1C2EB7B0650","accentColor":"4A4A4A"},"1AB08744676BC58AA8FE11F373863BFC4D6A9380":{"name":"AIML 101: BFS and DFS Algorithms Overview and Analysis - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.wg6OaAX0qXSy_pWLOnYc6QHaEK?pid=Api","datePublished":"2025-11-16T09:04:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/7b6e917cbd2e7b24b7f8f5993fbf3062/thumb_784_441.png","hostPageUrl":"https://www.studocu.com/in/document/anna-university/artificial-intelligence-and-data-science-ai-ds/aiml-101-bfs-and-dfs-algorithms-overview-and-analysis/145775275","contentSize":"59080 B","width":784,"height":441,"cDNContentUrl":"https://th.bing.com/th/id/R.c20e8e6805f4a974b2fe958b3a761ce9?rik=oQt4RHa2XKiK7w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0839A6D4CFB368373F11EF8AA85CB67644780BA1","accentColor":"00CC52"},"6EEA66ADA9B6356F1E33BA6F7E18994902A9644F":{"name":"Explain DFS and BFS with example | summer-2014","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.X4p-jhXiN1G3L9RtLPzjuQAAAA?pid=Api","datePublished":"2020-12-26T17:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://gtu-paper-solution.com/upload/2130702/S2019/BFS_Example.png","hostPageUrl":"https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2014/Question-4-a","contentSize":"7469 B","width":381,"height":179,"cDNContentUrl":"https://th.bing.com/th/id/R.5f8a7e8e15e23751b72fd46d2cfce3b9?rik=5q5m2pprU%2fbhMw&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fBFS_Example.png&ehk=dra2N96gsHnbuXImuqLsn2s4aaZekXzIqw2zN81fHpE%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F4469A20949981E7F6AB33E1F6536B9ADA66AEE6","accentColor":"3C3C3C"},"71BF8A03559F25D5ACF8A68D75BFC3F974BC2A45":{"name":"BFS and DFS - it is helpful to students - DFS (Depth First Search ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.WBFGye3qVOaeHEUr6C8LQwHaJl?pid=Api","datePublished":"2024-03-02T03:48:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/b8d71775bdaaf3358a1b55696680e63f/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/bfs-and-dfs-it-is-helpful-to-students/85355166","contentSize":"300112 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.581146c9edea54e69e1c452be82f0b43?rik=F%2fuoMFX5Ul3Kjw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"54A2CB479F3CFB57D86A8FCA5D52F95530A8FB17","accentColor":"71264C"},"78EBD237A4C0AC18975BCE2DAA9154C838343BBC":{"name":"BFS and DFS Algorithms: Graph Traversal Techniques (CS101) - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.ZViJ9Mt4-cuPqIoHeP6-xQHaKe?pid=Api","datePublished":"2025-12-17T23:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/659ce9edcd1f15f60a3227ad5c9a9359/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/industrial-economics-and-foreign-trade/bfs-and-dfs-algorithms-graph-traversal-techniques-cs101/149128083","contentSize":"1498114 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.655889f4cb78f9cb8fa88a0778febec5?rik=h74tc0oMyoF5tQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"CBB343838C4519AAD2ECB57981CA0C4A732DBE87","accentColor":"874454"},"B06EB5A6E334912E7409326483425C6BFA5A34DB":{"name":"BFS and DFS Algorithms: Steps and Process Explanation - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.EtWOiAF9jNxonSsqj9hfUAHaKd?pid=Api","datePublished":"2023-11-11T07:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/68e65efd23a6ac65265b0873386515a0/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/biju-patnaik-university-of-technology/computer-networks/bfs-and-dfs/75452472","contentSize":"213301 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.12d58e88017d8cdc689d2b2a8fd85f50?rik=C%2bZbaj5DGeJHkA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"BD43A5AFB6C5243846239047E219433E6A5BE60B","accentColor":"A72428"},"978C678E6E8003368A8A6E8E02DF6B93FAA49762":{"name":"Difference Between BFS, DFS, Best First Search, A-Star (A*) Algorithm","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.-333Mpv40Slz4zUp2OvwtwHaD4?pid=Api","datePublished":"2021-04-04T06:16:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg9HmB76CWlagJTY_h7VjxmDq54NHxCW5RxWqFISUTT_7CO2HljWVS15e-QhClnaAvcdAtpr3NMvuAppI3vLOSomgQfP2kCM-iKmOPbFFNj3xLtCXYEpsq0AP14gEtL_tiI4-QIkshvuNUz/w1200-h630-p-k-no-nu/Defference+Between+Search+Algorithm.jpg","hostPageUrl":"https://www.fiedge.in/2020/03/difference-between-bfs-dfs-best-first_10.html","contentSize":"126559 B","width":878,"height":461,"cDNContentUrl":"https://th.bing.com/th/id/R.fb7df7329bf8d12973e33529d8ebf0b7?rik=ech26OYIMGOoqA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"26794AAF39B6FD20E8E6A8A8633008E6E876C879","accentColor":"768D3E"},"D8546B1EA5AC0F3CB74B22F97DAE82F9EDA33F64":{"name":"DFS algorithm in Python - Python3 program to print DFS traversal from a ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.AKfdqP3pF8cHvWQMz8gC6QHaKe?pid=Api","datePublished":"2022-05-04T10:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/e35f79cdfa065538cd79fce27053e87f/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/information-technology/dfs-algorithm-in-python/24557353","contentSize":"278617 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.00a7dda8fde917c707bd640ccfc802e9?rik=jUW24VrK8MN7tA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"46F33ADE9F28EAD79F22B47BC3F0CA5AE1B6458D","accentColor":"0202C9"},"BC1EA6D1D80CE100378CEE74C54A8DD2230E0F02":{"name":"CS101: Algorithms - BFS, DFS, A*, Hill Climbing & Minimax Experiments ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.sxTHtqQ3NOlTXt3Zwvel9wHaJl?pid=Api","datePublished":"2026-01-09T06:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/8fa342f822c3ff73d421822a5fef7ce5/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/btech-cse-3rd-year/cs101-algorithms-bfs-dfs-a-hill-climbing-minimax-experiments/150417702","contentSize":"56708 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.b314c7b6a43734e9535eddd9c2f7a5f7?rik=y%2bFqHY3AHgBzyA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"20F0E0322DD8A45C47EEC873001EC08D1D6AE1CB","accentColor":"444444"},"0AEA26B42A491327B15D264246D1E4FF55C0F1CA":{"name":"BFS and DFS Algorithm Implementation - CED Lab Manual Exp. 3 - Studocu","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.ARpWkQF-lq3PfqQJAK1_iQHaJl?pid=Api","datePublished":"2022-03-01T06:58:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/310cf646c274735a878bdd2abe5d06c4/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/bfs-and-dfs-algorithm/23048132","contentSize":"169814 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.011a5691017e96adcf7ea40900ad7f89?rik=oK5iS6KUMXIb1Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AC1F0C55FF4E1D642462D51B723194A24B62AEA0","accentColor":"22A95A"},"AE7A026DBE61460095659F54F09FB294F7731609":{"name":"21CS54 M1 PP - BFS & DFS Algorithms in Graph Traversal - Studocu","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.J52c3Mx2aNIqIhDgTN2tMAHaJl?pid=Api","datePublished":"2025-12-21T12:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/a5908971f50540c93fdf0815d49c10b8/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/visvesvaraya-technological-university/machine-learning/21cs54-m1-pp-bfs-dfs-algorithms-in-graph-traversal/149264763","contentSize":"147397 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.279d9cdccc7668d22a2210e04cddad30?rik=6qcg1usWZABZVg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9061377F492BF90F45F95659006416EBD620A7EA","accentColor":"CC0000"},"18B1B41E167D2F45EB497AFB78B67138BB92470B":{"name":"AI Practical Codes: DFS & BFS Algorithms and Family Tree Example - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.ng9svkbAjHJdDYCJnI7DqgHaKd?pid=Api","datePublished":"2025-04-26T09:48:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/70056fdbbaa89197416b8ee30d1e599b/thumb_1200_1694.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-mumbai/computer-engineering/ai-practical-codes-dfs-bfs-algorithms-and-family-tree-example/124873710","contentSize":"72297 B","width":1200,"height":1694,"cDNContentUrl":"https://th.bing.com/th/id/R.9e0f6cbe46c08c725d0d80899c8ec3aa?rik=gRtL4WHX8lS%2blA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B07429BB83176B87BFA794BE54F2D761E14B1B81","accentColor":"4C4C4C"},"32BF45EB379064EB2BF01052B88B95F732616C18":{"name":"BFS and DFS Algorithms - A Deep Dive in Data Structures - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.6e9wfntxwJ4IQRa1aJqnEwHaJl?pid=Api","datePublished":"2023-03-10T04:14:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/dd6f2e5977430d063debc368a25fae17/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/i-k-gujral-punjab-technical-university/bachelor-of-computer-applications/bfs-and-dfs-data-structures/49609720","contentSize":"228838 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.e9ef707e7b71c09e084116b5689aa713?rik=I%2ftUvnMJRr6yDw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"81C616237F59B88B25010FB2BE460973BE54FB23","accentColor":"844775"},"D1212FE0752E0D3B3320EE714E025FB33A7155BA":{"name":"BFS and DFS Algorithms - Practical Notes for Graph Search - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.uG1R80bFd6vY0bVImcYuugHaJl?pid=Api","datePublished":"2024-11-13T10:10:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/d4be58fbd7a4f4a5f2339fbf1eb31d74/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/adi-shankara-institute-of-engineering-technology/data-structures/bfs-dfs-example-practical-notes/110664527","contentSize":"186781 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.b86d51f346c577abd8d1b54899c62eba?rik=HRLyDlfi0LMzAg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AB5517A33BF520E417EE0233B3D0E2570EF2121D","accentColor":"994200"},"9AC9BF1D6BBB78ABAC59B71215596FE80476DC01":{"name":"BFS and DFS algorithm in C - BFS algorithm in C #include #include - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.N47UbkaZxNdd_GJPHJNZtAHaJl?pid=Api","datePublished":"2023-12-18T03:14:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/7a8ed187c32a12dced71cd28e421ef84/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/indian-institute-of-technology-indian-school-of-mines-dhanbad/mtech/bfs-and-dfs-algorithm-in-c/78059182","contentSize":"78760 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.378ed46e4699c4d75dfc624f1c9359b4?rik=qZz70ba7h7rKlQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"10CD67408EF69551217B95CABA87BBB6D1FB9CA9","accentColor":"666666"},"E7D4E7E76C7748E737666C7ABD1EA9F4DECA7121":{"name":"Practical Programs for Algorithms: Selection Sort, TSP, Knapsack, DFS ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.AsvzAut5EkE8Q-OLVQxozgHaJl?pid=Api","datePublished":"2026-01-15T22:13:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/a218d02ab364b5cfc119bc317b077fa4/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/bagalkot-university/design-and-analysis-of-algorithm/practical-programs-for-algorithms-selection-sort-tsp-knapsack-dfs-bfs-and/143485025","contentSize":"82205 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.02cbf302eb7912413c43e38b550c68ce?rik=fk1%2bfsZ3hH5zZg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"1217ACED4F9AE1DBA7C666737E8477C67E7E4D7E","accentColor":"4D4D4D"},"8EFB8F41C89CF19041D32B38366BAC351A184CE1":{"name":"AI BFS and DFS: Depth First Search Algorithm Overview - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.eaO6M4vqKR_Znaax1aDAZwHaKd?pid=Api","datePublished":"2026-01-03T09:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/1302718db48e91df98e26f670aed2a4d/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/prasad-v-potluri-siddhartha-institute-of-technology/information-technology/ai-bfs-and-dfs-depth-first-search-algorithm-overview/149991822","contentSize":"145886 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.79a3ba338bea291fd99da6b1d5a0c067?rik=6L%2f4FIzJHwkUPQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"1EC481A153CAB66383B23D14091FC98C14F8BFE8","accentColor":"464646"},"58ACE77A7292BC399FF6A58A92FD72BC9232B6F2":{"name":"Algorithm-1: BFS, DFS, Sorting & Graph Algorithms (CS101) - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.fU4muKDYnsCQht3avHt0-wHaJl?pid=Api","datePublished":"2025-10-15T06:58:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/14efff5dcbda6fdff79a089e610ab790/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/anna-university/computer-science-and-engineering/algorithm-1-bfs-dfs-sorting-graph-algorithms-cs101/141998237","contentSize":"218473 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.7d4e26b8a0d89ec09086dddabc7b74fb?rik=hcp%2bpycpy5P5bw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2F6B2329CB27DF29A85A6FF993CB2927A77ECA85","accentColor":"484848"},"FD665CE31558D600669F2F9A76E6B7282DB032A1":{"name":"Module 11: Advanced Data Structures and Algorithms - BFS, DFS, AVL ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.9lfUeoiljPmvEJ1ijv70hQHaKe?pid=Api","datePublished":"2025-05-06T05:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/6c6fb27ac13d59e1c63cc16e922dcf5d/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/algorithm-analysis-and-design/module-11-advanced-data-structures-and-algorithms-bfs-dfs-avl-trees/125941267","contentSize":"721944 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.f657d47a88a58cf9af109d628efef485?rik=32bFPlGFbQBm%2bQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"1A230BD2827B6E67A9F2F966006D85513EC566DF","accentColor":"BD5E0E"},"9F276A566DDF5CED2EF3EE55C130C38CE09F86A4":{"name":"Practical Exercises on Uninformed Search Algorithms (BFS, DFS, A* ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.chVfpgpaivwMSnDzcSIklAHaKe?pid=Api","datePublished":"2025-02-07T03:36:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/435ed12edeba55203a3a264eb1cfc83d/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/srm-madurai-college-for-engineering-and-technology/soft-computing/doc-scanner-jan-21-2025-3-15-pm/117484327","contentSize":"652298 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.72155fa60a5a8afc0c4a70f371222494?rik=%2bXKmZdb9xd7iPw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4A68F90EC83C031C55EE3FE2DEC5FDD665A672F9","accentColor":"442D28"},"C2C55FC191AF67B6EAFD74D5955ECDE07F2C702B":{"name":"Depth First Search in Python (with Code) DFS Algorithm Fav Tutor ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.5WB9yhZvwHNUPO9qUALBJAHaKe?pid=Api","datePublished":"2024-02-28T22:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/7e9643114f01bf234844ffadf1df05b4/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-burdwan/population-geography/depth-first-search-in-python-with-code-dfs-algorithm-fav-tutor/84074232","contentSize":"340314 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.e5607dca166fc073543cef6a5002c124?rik=LFz1HBn6dmuu3w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B207C2F70EDCE5595D47DFAE6B76FA191CF55C2C","accentColor":"BF6A0C"},"0261055004FA11946F56C7D7C5DA8BF8A5201EF7":{"name":"Water Jug Problem Solver: DFS & BFS Algorithms - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.OqUF3FcG8KCZe3p5aO_8SQHaEK?pid=Api","datePublished":"2025-11-15T08:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/a8d727f5cac697ee200873ad6e7c83ba/thumb_784_441.png","hostPageUrl":"https://www.studocu.com/in/document/shanmugha-arts-science-technology-and-research-academy/computer-science/water-jug-problem-solver-dfs-bfs-algorithms/145684297","contentSize":"48871 B","width":784,"height":441,"cDNContentUrl":"https://th.bing.com/th/id/R.3aa505dc5706f0a0997b7a7968effc49?rik=IBZQBUCvEUn2ZQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7FE1025A8FB8AD5C7D7C65F64911AF4005501620","accentColor":"444444"},"42579D467560A37A25C55C1C15927685131F3852":{"name":"AI-LAB: Water Jug Problem Solution Using DFS and BFS Algorithms - Studocu","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.uZVvYPpOAUg4N8klBTzASwHaKd?pid=Api","datePublished":"2024-08-22T17:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/0f3852ea6adbe2b9f6738e36ac826fb2/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/visvesvaraya-technological-university/artificial-intelligence/ai-lab-programs/102171976","contentSize":"177812 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.b9956f60fa4e01483837c925053cc04b?rik=JHXZZFcGOqdSXA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2583F13158672951C1C55C52A73A065764D97524","accentColor":"666666"},"4397F9DDBB784F63E4AB067C142166BECD054858":{"name":"DAA PYQ: Space & Time Complexity, BFS, DFS, and Sorting Algorithms ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.eVKojlykHNx-YBtUT5jzlQHaEK?pid=Api","datePublished":"2025-11-12T22:58:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/c630f0846047ba7c1c71b30aff177b90/thumb_784_441.png","hostPageUrl":"https://www.studocu.com/in/document/bihar-engineering-university-patna/beu-btech-2-sem-engineering-graphics-design-pyq/daa-pyq-space-time-complexity-bfs-dfs-and-sorting-algorithms-2016-2020/145258084","contentSize":"336573 B","width":784,"height":441,"cDNContentUrl":"https://th.bing.com/th/id/R.7952a88e5ca41cdc7e601b544f98f395?rik=NHmf3buH9DZOug&pid=ImgRaw&r=0","isTransparent":false,"imageId":"858450DCEB661241C760BA4E36F487BBDD9F7934","accentColor":"41456C"},"58FD3C167BFD2AF991336F7E525E50FD6D190A22":{"name":"Master BFS & DFS: Essential Graph Algorithms Explained –Notes","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.zy98Vkh2CvUB9Z0P5r-YuQHaE7?pid=Api","datePublished":"2025-07-08T19:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://notes.suhaib.in/images/featured/graph-traversals-mastering-bfs-and-dfs-3482441.jpg","hostPageUrl":"https://notes.suhaib.in/docs/code/graph/theory/graph-traversals---bfs--dfs/","contentSize":"101913 B","width":1880,"height":1253,"cDNContentUrl":"https://th.bing.com/th/id/R.cf2f7c5648760af501f59d0fe6bf98b9?rik=hd%2fDYbffop8ZMw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"22A091D6DF05E525E7F633199FA2DFB761C3DF85","accentColor":"AA2133"},"94BC8E30D8D56AA34360B0795796949CCE53C304":{"name":"DFS vs. BFS: A Student’s Guide to Graph Traversal Algorithms","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.2QiW9mDU-EX7dgEozsDR5wHaB2?pid=Api","datePublished":"2025-11-28T06:53:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.lingayasvidyapeeth.edu.in/sanmax/wp-content/uploads/2026/02/Admission-open-Website-Page-Graphics-1100x275-Pixel.webp","hostPageUrl":"https://www.lingayasvidyapeeth.edu.in/dfs-vs-bfs-a-students/","contentSize":"57952 B","width":1100,"height":275,"cDNContentUrl":"https://th.bing.com/th/id/R.d90896f660d4f845fb760128cec0d1e7?rik=ScvoA41dpjo0Bg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"403C35ECC9496975970B06343AA65D8D03E8CB49","accentColor":"B65C15"},"BAFA1E22CF558159ADB74B4783AC4002AD24C717":{"name":"AI Algorithms - Notes on BFS, DFS, TSP, and More (CS101) - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.sS9HDbUrvF47JRGlCDGxZQHaJl?pid=Api","datePublished":"2025-09-12T02:20:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/7b45080acf4711c8d96f77cc379b2201/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/kuppam-engineering-college/electronics-and-communication-engineering/ai-algorithms-notes-on-bfs-dfs-tsp-and-more-cs101/137984778","contentSize":"153330 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.b12f470db52bbc5e3b2511a50831b165?rik=q6%2fhIvxVGJXaew&pid=ImgRaw&r=0","isTransparent":false,"imageId":"717C42DA2004CA3874B47BDA951855FC22E1AFAB","accentColor":"666666"},"E71499A7858DB671A7B5B4E8CDDC4B00DB2CDB2B":{"name":"important Data structures and Algorithm Concepts | Talent Battle","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.WktDRp05JtId8ukG2XkDFAAAAA?pid=Api","datePublished":"2022-11-04T21:08:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://talentbattle.in/Files/C4U_Images/C4U_CKEDITOR_IMAGES/IMG10382_BFSDFS1.PNG","hostPageUrl":"https://talentbattle.in/technical-interview-questions-and-concepts/data-structures-and-algorithm-concepts","contentSize":"86038 B","width":370,"height":372,"cDNContentUrl":"https://th.bing.com/th/id/R.5a4b43469d3926d21df2e906d9790314?rik=fkGZeljYaxd6Ww&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B2BDC2BD00B4CDDC8E4B5B7A176BD8587A99417E","accentColor":"1498B7"},"412F0761528CAC32AA3BB20F4B0C97363F17E62C":{"name":"Graph Algorithms: DFS & BFS Techniques - CS101 Lecture Notes - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.__HSF0NlLwmuPYukGWCY6gHaKe?pid=Api","datePublished":"2025-05-30T15:37:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/bf5ea4c12cdead78c13b5ee92c71aeec/thumb_1200_1697.png","hostPageUrl":"https://www.studocu.com/in/document/psg-college-of-technology/dbms/graph-algorithms-dfs-bfs-techniques-cs101-lecture-notes/128790448","contentSize":"372337 B","width":1200,"height":1697,"cDNContentUrl":"https://th.bing.com/th/id/R.fff1d21743652f09ae3d8ba4196098ea?rik=FPJwFiXIyiOqsw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C26E71F36379C0B4F02BB3AA23CAC8251670F214","accentColor":"775E50"},"2D325020CB53CC2B1729258720B4AB9BA77C159C":{"name":"Exp No. 1: Implementation of Uninformed Search Algorithms (BFS, DFS ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.Gk6erdvt7HBBAB9xyImNMgHaKd?pid=Api","datePublished":"2025-10-16T02:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/42b116861eff9cd522734461adcab027/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/st-xaviers-catholic-college-of-engineering/big-data-analytics/exp-no-1-implementation-of-uninformed-search-algorithms-bfs-dfs/142142231","contentSize":"83539 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.1a4e9eaddbedec7041001f71c8898d32?rik=0iMFArw1zLJxkg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C951C77AB9BA4B0278529271B2CC35BC020523D2","accentColor":"4C4C4C"},"6A443FD4AA2803A1C0D51D722411B782D3D627F7":{"name":"Striver Graph Algorithms Notes (CS101) - BFS, DFS, MST, Cycle Detection ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.YpnI1HJRQNvpN45nq9_7ugHaKd?pid=Api","datePublished":"2025-07-06T01:43:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/d8a0548f5bb08aeb0976f408e8d92dff/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/indian-institute-of-technology-madras/data-structures-and-algorithms-graphs/striver-graph-algorithms-notes-cs101-bfs-dfs-mst-cycle-detection/124574492","contentSize":"579976 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.6299c8d4725140dbe9378e67abdffbba?rik=pkTzTaqCMBoMXQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7F726D3D287B114227D15D0C1A3082AA4DF344A6","accentColor":"4C4770"},"0FA0AE1BB15A5CE42400CBB23CF64443CE4F7B57":{"name":"Python Programming Notes - PYTHON PROGRAMMING [R17A0554] LECTURE NOTES ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.JOfrhAgY_XX1OnId8HXNOgAAAA?pid=Api","datePublished":"2023-06-08T20:38:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/7b2ea3212e1bb944c8fa46eb01e7b2e8/thumb_300_388.png","hostPageUrl":"https://www.studocu.com/in/document/meenakshi-sundararajan-engineering-college/problem-solving-and-python-programming/python-programming-notes/54261550","contentSize":"28186 B","width":300,"height":388,"cDNContentUrl":"https://th.bing.com/th/id/R.24e7eb840818fd75f53a721df075cd3a?rik=8ArqsRulxU5CAA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"75B7F4EC34446FC32BBC00424EC5A51BB1EA0AF0","accentColor":"4B5455"},"637DDD02209765206CD558EA34DB5F2395561070":{"name":"Virtual Labs","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.2uzjqFca7KnMaZUvDR2psAHaET?pid=Api","datePublished":"2021-03-23T15:44:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/bfs/images/bfs_steps.png","hostPageUrl":"https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/bfs/bfs-algorithm.html","contentSize":"298982 B","width":2367,"height":1377,"cDNContentUrl":"https://th.bing.com/th/id/R.daece3a8571aeca9cc69952f0d1da9b0?rik=NtfdIAJ5VgLGXQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0701655932F5BD43AE855DC60256790220DDD736","accentColor":"71A02B"},"586D85244B6344C0F1AFECDB428A55BB4B29DB99":{"name":"AI & ML Lab Notes: Implementation of Search Algorithms & Models (CS3491 ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.JceNdGrfLhMMlxGD72r-nAHaKd?pid=Api","datePublished":"2024-12-13T01:41:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/d68ae5badbc4034b77df073e3528cee3/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/anna-university/artificial-intelligence-and-data-science/aiml-manual-new-copy-lab-notes/113654552","contentSize":"152347 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.25c78d746adf2e130c971183ef6afe9c?rik=hdZYQrQ2RAwf%2bg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"99BD92B4BB55A824BDCEFA1F0C4436B44258D685","accentColor":"424242"},"627939F823651292D7AA940BABBEFAA0C388D005":{"name":"AI Codes 2: BFS, DFS, A* & Minimax Algorithms - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.jOjqqJOYOONyTco_RIfCGgHaKd?pid=Api","datePublished":"2025-10-07T03:16:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/fce6b8a97877d133182b052014f1cd30/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/vellore-institute-of-technology/artificial-intelligence/ai-codes-2-bfs-dfs-a-minimax-algorithms/140875992","contentSize":"53222 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.8ce8eaa8939838e3724dca3f4487c21a?rik=JpeTjzJWISl9qg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"500D883C0AAFEBBAB049AA7D292156328F939726","accentColor":"4F4F4F"},"BFD6812C5DDB0AF47DCE4DF8BA563F55B26B2E63":{"name":"GPS Application Algorithms: BFS & DFS for Route Finding - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.YpsnSCLfjam5pk39IBc5kQHaKd?pid=Api","datePublished":"2025-05-10T06:24:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/8b39172f697cc50b166433dca7a8e017/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/srm-institute-of-science-and-technology/artificial-intelligence/gps-application-algorithms-bfs-dfs-for-route-finding/126493884","contentSize":"394899 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.629b274822df8da9b9a64dfd20173991?rik=%2b20YwtW9oE%2fX7A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"36E2B62B55F365AB8FD4ECD74FA0BDD5C2186DFB","accentColor":"2E729D"},"342A27B44F1875EEF9CB9ED70A8E0D4532C9F890":{"name":"Depth First Search (DFS) Algorithm - Scaler Topics","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.7GuyTLoJbjMix6Z1XP7l8wHaEe?pid=Api","datePublished":"2024-11-11T03:27:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://scaler.com/topics/images/DFS-example","hostPageUrl":"https://www.saludolearning.in/topics/data-structures/depth-first-search-dfs-algorithm/index.html","contentSize":"48980 B","width":1701,"height":1028,"cDNContentUrl":"https://th.bing.com/th/id/R.ec6bb24cba096e3322c7a6755cfee5f3?rik=Q6JyS%2fSBV%2b6fvA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"098F9C2354D0E8A07DE9BC9FEE5781F44B72A243","accentColor":"016ECA"},"7A9024C481246A2CB7F54EF52696E0F10C3AEF9F":{"name":"BFS Algorithm and DFS algorithm Assignment - Data Analysis - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.cQ2R1JjzdIJ3ftCxTxFd1gAAAA?pid=Api","datePublished":"2022-02-07T22:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://lh3.googleusercontent.com/a-/AFdZucrpJNo85dxDnGGYimJAixMSPBbDNZuX7EqWcrkN=s96-c","hostPageUrl":"https://www.studocu.com/in/document/amity-university/data-analysis/bfs-algorithm-and-dfs-algorithm-assignment/19465350","contentSize":"3588 B","width":96,"height":96,"cDNContentUrl":"https://th.bing.com/th/id/R.710d91d498f37482777ed0b14f115dd6?rik=pwlCTBhCpsJ7Xw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F9FEA3C01F0E69625FE45F7BC2A642184C4209A7","accentColor":"03B8C8"},"B86132DC78753B57247F750702F0F553F0D54735":{"name":"AI Practical - Depth First Search Algorithm # DFS algorithm def dfs ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.Nz-FXvNg0JiZgGMkICSPYAAAAA?pid=Api","datePublished":"2024-05-05T08:55:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/4f325a0df3799e48a501e1a680e4bccd/thumb_300_424.png","hostPageUrl":"https://www.studocu.com/in/document/dr-babasaheb-ambedkar-technological-university/artificial-intelligence/ai-practical/89243059","contentSize":"12115 B","width":300,"height":424,"cDNContentUrl":"https://th.bing.com/th/id/R.373f855ef360d0989980632420248f60?rik=ixYjzYdXs3VC9w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"53745D0F355F0F207057F74275B35787CD23168B","accentColor":"464646"},"912111C740ABBC03D4D063F1E3B880F820728039":{"name":"Graph Representation - Data Structures Tutorial | Study Glance","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.f1X4pd5y5ryhnLeBNJT3UwHaFh?pid=Api","datePublished":"2023-12-11T18:29:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://studyglance.in/ds/images/Adjacency-List.jpg","hostPageUrl":"https://studyglance.in/ds/display.php?tno=33&topic=Breadth-First-Search","contentSize":"274296 B","width":1343,"height":1001,"cDNContentUrl":"https://th.bing.com/th/id/R.7f55f8a5de72e6bca19cb7813494f753?rik=GRIRfAS6yzBNDQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"930827028F088B3E1F360D4D30CBBA047C111219","accentColor":"0A2B6A"},"6C954090B76498602E48AFFD910F9D19BB451564":{"name":"Virtual Labs","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.07I8vWyULnKjti8wZ5HjIAHaF4?pid=Api","datePublished":"2021-03-23T15:44:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/analysis/images/bfs.png","hostPageUrl":"https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/analysis/comparison-with-other-algorithms.html","contentSize":"188129 B","width":633,"height":503,"cDNContentUrl":"https://th.bing.com/th/id/R.d3b23cbd6c942e72a3b62f306791e320?rik=xlkECXtGiQbihA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"465154BB91D9F019DFFA84E20689467B090459C6","accentColor":"596772"},"0B5CE73FC6BFE272915E46448058BA9964904C98":{"name":"AI&ML LAB - Algorithms Implementation: BFS, DFS, Naïve Bayes and ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP._K4IVJ0kodWCjv3yTlu7bwHaKd?pid=Api","datePublished":"2024-11-22T09:34:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/6873ee7a0b2e9d34356eb0aff608f536/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/anna-university/aiml/aiml-lab-lab/108246114","contentSize":"162664 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.fcae08549d24a1d5828efdf24e5bbb6f?rik=sMV%2b82z7LicZ5Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"89C4094699AB85084464E519272EFB6CF37EC5B0","accentColor":"434343"},"AED825D633CE5AB4AAA6741450BB843CAF1AFC67":{"name":"12 Computer Science-Datastructure-Notes - CLASS-XII COMPUTER SCIENCE ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.LV0ia9Q7kCKWmO2pSZzb-gHaKd?pid=Api","datePublished":"2023-05-30T14:09:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/15642ed5f230e1b709a2a7b7f36a854c/thumb_1200_1696.webp","hostPageUrl":"https://www.studocu.com/in/document/seshadripuram-college/bachelors-of-computer-applications/12-computer-science-datastructure-notes/38890578","contentSize":"89792 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.2d5d226bd43b90229698eda9499cdbfa?rik=6o1SbTPspUuqag&pid=ImgRaw&r=0","isTransparent":false,"imageId":"76CFA1FAC348BB0541476AAA4BA5EC336D528DEA","accentColor":"666566"},"0CF42C48FA6547C85596C4A4B7CE402A12AF8595":{"name":"Practical No 1-3: Implementing DFS & BFS Algorithms for Graph Traversal ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.P5piMMFYF5P1JSrNHvyoZgHaKd?pid=Api","datePublished":"2025-02-17T14:36:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/d800df26ea4b383601c9228045f44839/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/practical-no1-3/118337575","contentSize":"435430 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.3f9a6230c1581793f5252acd1efca866?rik=wE%2fChK9WdIxVaQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5958FA21A204EC7B4A4C69558C7456AF84C24FC0","accentColor":"620AC1"},"1C312D4F9BA515D30B0BF33FCFBE050EA93B6534":{"name":"Graph Traversal Algorithms BFS and DFS - MODULE 3: GRAPH AND TREE ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.XEGsZCCFPqUSR57-81MQBQAAAA?pid=Api","datePublished":"2024-01-26T09:12:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/6ec1ad7400b4fb8a2972f0d69559dfb8/thumb_300_388.png","hostPageUrl":"https://www.studocu.com/in/document/sardar-vallabhbhai-patel-university-of-agriculture-and-technology/techniques-in-biochemistry/graph-traversal-algorithms-bfs-and-dfs/78800524","contentSize":"34428 B","width":300,"height":388,"cDNContentUrl":"https://th.bing.com/th/id/R.5c41ac6420853ea512479efef3531005?rik=wRPS9LlaUT2wsA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4356B39AE050EBFCF33FB0B03D515AB9F4D213C1","accentColor":"222222"},"99E7E1BCF8D7515972823F699D7A3830E040FC75":{"name":"CS 3491 Laboratory Manual: Implementing Search Algorithms (BFS & DFS ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.4UZpy-UrGDmKBNHEJSdXLwHaEK?pid=Api","datePublished":"2025-12-15T04:54:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/d3464055259dc214d057ee7dfbc57994/thumb_784_441.png","hostPageUrl":"https://www.studocu.com/in/document/anna-university/artificial-intelligence-and-data-science/cs-3491-laboratory-manual-implementing-search-algorithms-bfs-dfs/148888888","contentSize":"10991 B","width":784,"height":441,"cDNContentUrl":"https://th.bing.com/th/id/R.e14669cbe52b18398a04d1c42527572f?rik=mX4ey499FZUnKA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"57CF040E0383A7D996F3282795157D8FCB1E7E99","accentColor":"494949"},"5D16A00C9432AE11435D59D326AEFCFE5B735CA7":{"name":"In the following graphs, assume that if there is ever a choice amongst ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.bgY8cbDtTjMOPed_fd2UoQHaB5?pid=Api","datePublished":"2023-09-02T11:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/dc2/b69c950b4a28329e312f43f488b5def1.png","hostPageUrl":"https://brainly.in/question/57828396","contentSize":"14729 B","width":622,"height":160,"cDNContentUrl":"https://th.bing.com/th/id/R.6e063c71b0ed4e330e3de77f7ddd94a1?rik=1WEKwEkj6hE01Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7AC537B5EFCFEA623D95D53411EA2349C00A61D5","accentColor":"765568"},"BF04B222301E518D347D236F79BE0813316DCCC9":{"name":"What is the difference between depth first and breadth first search in ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.ZX27loXSODUwHPIRYqQZ4wHaKe?pid=Api","datePublished":"2019-01-08T20:12:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/db8/f32b9d81a794a8ffaa63fd80c0f2604e.jpg","hostPageUrl":"https://brainly.in/question/6454403","contentSize":"594536 B","width":2125,"height":3005,"cDNContentUrl":"https://th.bing.com/th/id/R.657dbb9685d23835301cf21162a419e3?rik=%2b0ArIgPhFdhD1w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9CCCD6133180EB97F632D743D815E103222B40FB","accentColor":"1E60AD"},"33F9F144E380412AE9CE75B2EE014939CAA3CD17":{"name":"AI Lab Manual (310253): Exploring DFS, BFS, A*, and Prim’s Algorithms ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.ipMooSCPsJZ2KbQ5ofr2NgHaJl?pid=Api","datePublished":"2025-02-14T08:14:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/6798980f2c82b9cee977b899e731d71d/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/ai-lab-manual/118002610","contentSize":"284425 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.8a9328a1208fb0967629b439a1faf636?rik=M58fRD4IFKKe7A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"71DC3AAC939410EE2B57EC9EA214083E441F9F33","accentColor":"837A48"},"8BD4A53200FB0EDE6F3118413ADEC1AE8C11CCD4":{"name":"Exp-1: Depth First Search & Breadth First Search Algorithms - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.MApV06Ez7sxAtUOJffllMAHaKd?pid=Api","datePublished":"2025-10-05T09:14:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/6915e81121e560bff9491a472390205e/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/artificial-intelligence-and-data-science/exp-1-depth-first-search-breadth-first-search-algorithms/140757175","contentSize":"198416 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.300a55d3a133eecc40b543897df96530?rik=uE1aIwC%2f4O32Ew&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4DCC11C8EA1CEDA3148113F6EDE0BF00235A4DB8","accentColor":"4D4D4D"},"884CB9E9151045E4BB0D09DBA30BE3E1BA1C8B1D":{"name":"Depth-first and breadth-first search in Haskell","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.O0Ece5lWJWt1AKpuuGG3gAAAAA?pid=Api","datePublished":"2021-04-19T02:29:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://malv.in/images/xkcd-2407-depth_and_breadth.png","hostPageUrl":"https://malv.in/posts/2021-01-09-depth-first-and-breadth-first-search-in-haskell.html","contentSize":"79514 B","width":350,"height":449,"cDNContentUrl":"https://th.bing.com/th/id/R.3b411c7b9956256b7500aa6eb861b780?rik=iMSbnlEBVE670A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D1B8C1AB1E3EB03ABD90D0BB4E5401519E9BC488","accentColor":"363636"},"0AA3B6D0FDD2BAF0AD6EDB18B3705597DCECA63F":{"name":"EXP4 - Roll No:- LAB MANUAL Experiment No. 4 :Uninformed Search- BFS ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.beDpn-Gdl1DxAPxbx0HVjwHaJl?pid=Api","datePublished":"2024-03-27T20:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/231ac6ebe87285490a6ba5a40f436385/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-mumbai/computer-engineering/exp4/86909938","contentSize":"150992 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.6de0e99fe19d9750f100fc5bc741d58f?rik=oDprDd8tqw%2fa5g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F36ACECD7955073B81BDE6DA0FAB2DDF0D6B3AA0","accentColor":"434343"},"D86F6A4C9DA06641FFD871BA4EF53E2BF45C9DE9":{"name":"DFS and BFS implemnet - EXPERMENT NO: 4 NAME OF THE EXPERMENT: BFS ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.1L8kKDipio3ZfbdcUqlMxwHaJl?pid=Api","datePublished":"2023-03-03T11:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a001a774bb8c92700dc65cdb36e787f3/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/gujarat-technological-university/analysis-and-design-of-algorithms/dfs-and-bfs-implemnet/47442183","contentSize":"220806 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.d4bf242838a98a8dd97db75c52a94cc7?rik=jfamxNkKZhT%2fjQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9ED9C54FB2E35FE4AB178DFF14660AD9C4A6F68D","accentColor":"C06B0B"},"EDEE004830C639D97F592EEE022D4710ED3693A2":{"name":"DFS Algorithm Implementation - LAB - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.FPyZoe2qg101jr32ayH2HQHaKd?pid=Api","datePublished":"2026-02-17T21:42:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/d3d1162bfe6fd9460ae25d1dcdcad9d3/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/manonmaniam-sundaranar-university/data-structure/dfs-algorithm-implementation-lab/153627441","contentSize":"128737 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.14fc99a1edaa835d358ebdf66b21f61d?rik=3u4AhANsk533lQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2A3963DE0174D220EEE295F79D936C038400EEDE","accentColor":"444444"},"65A433B2134483B5EE8963C66C22D315B5AA59D3":{"name":"AI Module 1 - Search Algorithms - MODULE 1 - SEARCH ALGORITHMS (BFS,DFS ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.lP4INc-BjgRRpFIG7JWy-wHaFu?pid=Api","datePublished":"2023-04-02T12:53:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/d040ecf60338ee5a5fc6281baeecdd70/thumb_1200_927.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-calicut/b-tech/ai-module-1-search-algorithms/49925622","contentSize":"81354 B","width":1200,"height":927,"cDNContentUrl":"https://th.bing.com/th/id/R.94fe0835cf818e0451a45206ec95b2fb?rik=VkozKzFEOFvumA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3D95AA5B513D22C66C3698EE5B3844312B334A56","accentColor":"363636"},"89392B8964D978C78D18ED7E81C64078A634D1D3":{"name":"Kosaraju using DFS - Algorithms - Computer Science Engineering (CSE ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.K_YXoYbDZUrBtVlxEqc1hAAAAA?pid=Api","datePublished":"2021-06-06T02:54:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://cn.edurev.in/ApplicationImages/ContentImages/7176ac8c-a1e4-44b5-ba38-27c171ef7aa1_icon.jpg","hostPageUrl":"https://edurev.in/t/187394/Kosaraju-using-DFS","contentSize":"4213 B","width":250,"height":143,"cDNContentUrl":"https://th.bing.com/th/id/R.2bf617a186c3654ac1b5597112a73584?rik=mJOymEadh3zYgQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3D1D436A87046C18E7DE81D87C879D4698B29398","accentColor":"3E8D54"},"87B72061A301CFF820DFBD5CD8C3532417F2D789":{"name":"Differentiate between DFS and BFS.","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.m5E22nQi5h3Atmf1aLcM9QHaCI?pid=Api","datePublished":"2022-12-25T15:04:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://vedveethi.co.in/eNote/DataStru/eNotes-DS-CS302-U5_files/image016.jpg","hostPageUrl":"https://vedveethi.co.in/eNote/DataStru/eNotes-DS-CS302-U5.htm","contentSize":"4807 B","width":486,"height":140,"cDNContentUrl":"https://th.bing.com/th/id/R.9b9136da7422e61dc0b667f568b70cf5?rik=eHsCFjoQ%2fI8C%2fQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"987D2F7142353C8DC5DBFD028FFC103A16027B78","accentColor":"666666"},"F060843840796F3F8D6E0D2E997AE36ADC64EDD4":{"name":"Python - Depth First Search Code Recursive","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.pXLLra0A8M60A3yKARfZ7QHaCC?pid=Api","datePublished":"2023-08-06T18:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Images/Python-Depth-First-Search-Code-Recursive10.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Python-Depth-First-Search-Code-Recursive.htm","contentSize":"11610 B","width":706,"height":194,"cDNContentUrl":"https://th.bing.com/th/id/R.a572cbadad00f0ceb4037c8a0117d9ed?rik=DwZIgwSX9vPY5g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4DDE46CDA63EA799E2D0E6D8F3F697048348060F","accentColor":"009242"},"A45664C42681C86D6B46774B39A0586386923A7F":{"name":"ALGORITHMS","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.RtLqSxNtCr-jdNtkrpAylgHaHa?pid=Api","datePublished":"2020-08-03T15:38:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/logo.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Algorithm.htm","contentSize":"123040 B","width":500,"height":500,"cDNContentUrl":"https://th.bing.com/th/id/R.46d2ea4b136d0abfa374db64ae903296?rik=SmVGTGIYjNa2ZA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F7A3296836850A93B47764B6D68C18624C46654A","accentColor":"C49E07"},"6525E43D38A9CAACB8870D2E997AE36ADC64EDD4":{"name":"Python - Depth First Search Code Recursive","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.qBN4mRjacvjQoVUdJ6jxFQAAAA?pid=Api","datePublished":"2023-08-06T18:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Images/Python-Depth-First-Search-Code-Recursive11.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Python-Depth-First-Search-Code-Recursive.htm","contentSize":"3195 B","width":140,"height":450,"cDNContentUrl":"https://th.bing.com/th/id/R.a813789918da72f8d0a1551d27a8f115?rik=VlJO04OarMqLeA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4DDE46CDA63EA799E2D0788BCAAC9A83D34E5256","accentColor":"CC3200"},"729F8D1CD2017B45384456EADDFEAC5D0BF027FA":{"name":"Breadth-First Search - Graph Algorithm","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.eyc_Kp1fkZlD-hnSLvbTTwHaEo?pid=Api","datePublished":"2024-01-06T21:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://learn.innoskrit.in/content/images/size/w1000/2024/01/BFS.gif","hostPageUrl":"https://learn.innoskrit.in/graph/breadth-first-search/","contentSize":"392761 B","width":1536,"height":960,"proxyContentUrl":"https://tse4.mm.bing.net/th/id/OGC.7b273f2a9d5f919943fa19d22ef6d34f?pid=Api&rurl=https%3a%2f%2flearn.innoskrit.in%2fcontent%2fimages%2fsize%2fw1000%2f2024%2f01%2fBFS.gif&ehk=yrs9ugA3i1TrEZsaiKAAIwTzOCl04ZfPEl6TZ2%2foB6Y%3d","cDNContentUrl":"https://th.bing.com/th/id/R.7b273f2a9d5f919943fa19d22ef6d34f?rik=J%2fnYwS0Qt1SDRA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AF720FB0D5CAEFDDAE65448354B7102DC1D8F927","accentColor":"C9A502"},"CCB3698FB78FBFA89445A3B19AAAACF5060BF920":{"name":"Python - Breadth First Search Code","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.Q-Uk31N2mxie_1qtpsuMFQAAAA?pid=Api","datePublished":"2023-08-06T18:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Images/Python-Breadth-First-Search-Code8.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Python-Breadth-First-Search-Code.htm","contentSize":"25489 B","width":405,"height":364,"cDNContentUrl":"https://th.bing.com/th/id/R.43e524df53769b189eff5aada6cb8c15?rik=zDuW%2bHv4%2b4pJVA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"029FB0605FCAAAA91B3A54498AFBF87BF8963BCC","accentColor":"C08C0B"},"553505430875912373D2BA406505986A65D295EC":{"name":"DFS (Depth First Search) algorithm - It is a recursive algorithm to ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.kRCpOIUlrUarU0eeDCiDhwHaKe?pid=Api","datePublished":"2022-12-31T04:40:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/d7eda2c423b72b014640fdf5932e4729/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/bharati-vidyapeeth-university/algorithms-and-data-structures/dfs-depth-first-search-algorithm/42781113","contentSize":"354399 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.9110a9388525ad46ab53479e0c288387?rik=VVNQNIBXGTI3LQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"CE592D56A689505604AB2D373219578034505355","accentColor":"6A1A44"},"A2FF398B697747A76ED247B9569FD8FA2C4F2671":{"name":"Best Data Structure Courses in Dharamshala & Hamirpur, Himachal Pradesh ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.oUdcep9xz-N92uQjOCuRTAHaIE?pid=Api","datePublished":"2024-09-29T17:24:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.netcoder.in/images/Data-Structures.png","hostPageUrl":"https://www.netcoder.in/data-structures.html","contentSize":"51753 B","width":1684,"height":1835,"cDNContentUrl":"https://th.bing.com/th/id/R.a1475c7a9f71cfe37ddae423382b914c?rik=Kv%2bTuJZ3dHrmLQ&pid=ImgRaw&r=0","isTransparent":true,"imageId":"1762F4C2AF8DF9659B742DE67A747796B893FF2A","accentColor":"C74504"},"753D2482EDB63F1EAAC97A8D223097F618DC436A":{"name":"Algorithms: introduction to algorithms Thomas H.cormen q.22.2-3","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.5o8J6mL1OUaPb2qQvC4nIAHaEb?pid=Api","datePublished":"2017-10-19T13:40:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=17871884588635617206","hostPageUrl":"https://gateoverflow.in/82109/introduction-to-algorithms-thomas-h-cormen-q-22-2-3","contentSize":"25592 B","width":600,"height":359,"cDNContentUrl":"https://th.bing.com/th/id/R.e68f09ea62f539468f6f6a90bc2e2720?rik=V9NCKN5r8%2bGqnA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A634CD816F790322D8A79CAAE1F36BDE2842D357","accentColor":"70695B"},"680A4473DACF11F34BF752EC3B19020268A44C1A":{"name":"AI Lab 8: Implementing the Monkey Banana Problem in Python - Studocu","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.9suvbPR4D1-4X1wcZVnBtQHaJl?pid=Api","datePublished":"2025-05-28T06:15:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/50e936e7115f1b794b6912dcc6470edf/thumb_1200_1553.webp","hostPageUrl":"https://www.studocu.com/in/document/siddhartha-institute-of-engineering-technology/computer-science-and-engineering/ai-lab-8-implementing-the-monkey-banana-problem-in-python/127802863","contentSize":"80776 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.f6cbaf6cf4780f5fb85f5c1c6559c1b5?rik=hqBEN638ET%2b0fw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A1C44A86202091B3CE257FB43F11FCAD3744A086","accentColor":"856246"},"37B125A38F259CA089025AE057FCBB85ADA250D3":{"name":"Breadth First Search - Bfs structure - Breadth First Search The only ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.UzmdLGbiUaE7SODg9uQqnAHaJl?pid=Api","datePublished":"2023-06-13T03:16:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/476ffa13865835370423d560050c4765/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-calicut/artificial-intelligence/breadth-first-search-bfs-structure/46009211","contentSize":"297282 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.53399d2c66e251a13b48e0e0f6e42a9c?rik=cxtSOvhSyQqYIA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3D052ADA58BBCF750EA520980AC952F83A521B73","accentColor":"078D07"},"72138260F6A7934B53B8E898C0FDD19132E7CB9B":{"name":"DFS Program in C Explained","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.EQMbK-ILodsv3TDOr1a3xQHaD5?pid=Api","datePublished":"2025-01-08T08:19:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/dfs-program-in-c-explained-images-4.png","hostPageUrl":"https://www.ccbp.in/blog/articles/dfs-program-in-c","contentSize":"17799 B","width":716,"height":377,"cDNContentUrl":"https://th.bing.com/th/id/R.11031b2be20ba1db2fdd30ceaf56b7c5?rik=JzEoBm96ObQ1iw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B9BC7E23191DDF0C898E8B35B4397A6F06283127","accentColor":"CB6400"},"7A170EBEAEEE0BD60DE5C04A7D3A73B8D900CC20":{"name":"Searching Strategies : Breadth First Search","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.fuKtzbeBLqPiHYVWAo0j2gHaKe?pid=Api","datePublished":"2020-12-12T18:13:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://minigranth.in/images/tutorials/AI%20IMAGES/BFS.jpg","hostPageUrl":"https://minigranth.in/artificial-intelligence-tutorial/searching-strategies-in-ai","contentSize":"179039 B","width":1240,"height":1754,"cDNContentUrl":"https://th.bing.com/th/id/R.7ee2adcdb7812ea3e21d8556028d23da?rik=p3Hg6%2brusG3QXg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"02CC009D8B37A3D7A40C5ED06DB0EEEAEBE071A7","accentColor":"434343"},"5C8F659BBE12D7270C79E78953024F52AA6E632D":{"name":"Difference between BFS and DFS BFS vs. DFS - Free Feast - 4/5/2017 ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.VqyQ8WZINA2mXyovaodKggHaJl?pid=Api","datePublished":"2021-09-18T17:23:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/c318f6b3ca2128f1f575191b3a0e9b5b/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/lovely-professional-university/data-structures/difference-between-bfs-and-dfs-bfs-vs-dfs-free-feast/5730029","contentSize":"485532 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.56ac90f16648340da65f2a2f6a874a82?rik=xfhWueshfXLAlw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D236E6AA25F42035987E97C0727D21EBB956F8C5","accentColor":"763C09"},"99D20B0A9F9B701AAF8E806EF93712073E36E1F4":{"name":"Mechanics VIVA- Question - Artificial Intelligence - ENGINEERING ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.7JQlhywmVc5iitRW-_OKmAAAAA?pid=Api","datePublished":"2023-03-20T04:13:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/21ef8ea0b3a61c1ef1a505d5a5ac74e9/thumb_300_424.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/mechanics-viva-question/39100304","contentSize":"56235 B","width":300,"height":424,"cDNContentUrl":"https://th.bing.com/th/id/R.ec9425872c2655ce628ad456fbf38a98?rik=mS2woPm5B6H66A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4F1E63E37021739FE608E8FAA107B9F9A0B02D99","accentColor":"505357"},"BD7F63809C4AEB33E9BA750702F0F553F0D54735":{"name":"AI Practical - Depth First Search Algorithm # DFS algorithm def dfs ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.7_E4ozYvQ4V3vNQa2KBwOQHaJl?pid=Api","datePublished":"2024-05-05T08:55:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/41634bbb60c6ead7ee83f5d2f0d56be5/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/dr-babasaheb-ambedkar-technological-university/artificial-intelligence/ai-practical/89243059","contentSize":"130962 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.eff138a3362f438577bcd41ad8a07039?rik=2%2fc2CMmkvjOeqw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"53745D0F355F0F207057AB9E33BEA4C90836F7DB","accentColor":"9B6030"},"ECA55A956096A5ACC71C0959E76A1DABE937BA82":{"name":"i-GATE Learning APP Online Examination Platform","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.n9Vj2P3eK5YGphqc_Re-IQAAAA?pid=Api","datePublished":"2024-08-30T23:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d3uz5ylpe6gfxz.cloudfront.net/institute/igate/chapter_contents/700b8c21759f46f4ab357aae30a60a59.jpeg","hostPageUrl":"http://igate.testpress.in/products/gate-cs-campus-recruitment-course-c-programming-data-structure-and-algorithm/","contentSize":"27781 B","width":320,"height":180,"cDNContentUrl":"https://th.bing.com/th/id/R.9fd563d8fdde2b9606a61a9cfd17be21?rik=zlqlWQZpWsp8wQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"28AB739EBAD1A67E9590C17CCA5A690659A55ACE","accentColor":"B9125B"},"DCE800C0BF989D08C83F57EBA88BAD94690525C9":{"name":"BFS Vs DFS Video Lecture - DSA in C++ - Software Development","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.nbJSMWYlxx5XIaHPvhLpVQHaFj?pid=Api","datePublished":"2023-05-19T02:16:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://img.youtube.com/vi/LMH1l2pR8Us/0.jpg","hostPageUrl":"https://edurev.in/v/266825/BFS-Vs-DFS","contentSize":"25976 B","width":480,"height":360,"cDNContentUrl":"https://th.bing.com/th/id/R.9db252316625c71e5721a1cfbe12e955?rik=zY4ADPuJ2YCM8w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9C52509649DAB88ABE75F38C80D989FB0C008ECD","accentColor":"5C0722"},"DA8502585E116E21CCF41AF2B35A8692B9C5DBC3":{"name":"SE-IT SEM3 DBMS MAY18 - AREGEARG - Artificial Intelligence - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.OBLfWAbSfvfYlBEx6uY_5AHaKK?pid=Api","datePublished":"2023-03-20T06:50:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/123e50f5a53e4a3665be0eb3dc7d4110/thumb_1200_1647.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/se-it-sem3-dbms-may18-aregearg/39099039","contentSize":"795530 B","width":1200,"height":1647,"cDNContentUrl":"https://th.bing.com/th/id/R.3812df5806d27ef7d8941131eae63fe4?rik=rVggheUR5hLMTw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3CBD5C9B2968A53B2FA14FCC12E611E5852058AD","accentColor":"6B6060"},"CEB7B6C7F4D12A33EBC19C9FCDDDD340382322BE":{"name":"Algorithms Python: Explains Algorithms with Beautiful Pictures Learn it ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.2g_gkdtqgjpXjD9cF3WF9wAAAA?pid=Api","datePublished":"2020-09-29T08:24:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://m.media-amazon.com/images/I/41s-dxS4v2L.jpg","hostPageUrl":"https://www.amazon.in/Algorithms-Python-Explains-Beautiful-Pictures-ebook/dp/B08CCZBNXZ","contentSize":"24619 B","width":405,"height":500,"cDNContentUrl":"https://th.bing.com/th/id/R.da0fe091db6a823a578c3f5c177585f7?rik=7HtrfE8dojO%2bHA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"EB223283043DDDDCF9C91CBE33A21D4F7C6B7BEC","accentColor":"C79804"},"D8F25CE26C2993C1C5023BA433D9BB44D1EEEE83":{"name":"BFS algorithm In Data Structure - BFS algorithm In this article, we ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.2RLucD5WKIplcHSYxgXU7gHaKe?pid=Api","datePublished":"2022-03-05T17:10:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a27d91198954806a053e885483682463/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/btech/bfs-algorithm-in-data-structure/22559861","contentSize":"223708 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.d912ee703e56288a65707498c605d4ee?rik=jS%2fFLsaSORxcIA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"38EEEE1D44BB9D334AB3205C1C3992C62EC52F8D","accentColor":"434343"},"3BB32009FD4BFFA2BFFD9ED70A8E0D4532C9F890":{"name":"Depth First Search (DFS) Algorithm - Scaler Topics","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.Dap7VSPUJ5RusO-SIeteagHaEK?pid=Api","datePublished":"2024-11-11T03:27:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://i.vimeocdn.com/video/1528425040-ea46b016c6110338e94dd196df83d406b10c3efc80313758f8c5d8a1e412c2f5-d","hostPageUrl":"https://www.saludolearning.in/topics/data-structures/depth-first-search-dfs-algorithm/index.html","contentSize":"78004 B","width":1920,"height":1080,"cDNContentUrl":"https://th.bing.com/th/id/R.0daa7b5523d427946eb0ef9221eb5e6a?rik=szsCkN%2b0%2fyr73w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"098F9C2354D0E8A07DE9DFFB2AFFB4DF90023BB3","accentColor":"949536"},"DCECBE83714E045482BB556E25DC481F75B69E64":{"name":"“A BFS-DFS Approach” Semi-Stock-Temporal Graph Traversals for Market ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.v9HBT7gryUAlTnAJOP65sQHaCf?pid=Api","datePublished":"2025-12-29T17:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ir.vistas.ac.in/logo.jpg","hostPageUrl":"https://ir.vistas.ac.in/id/eprint/12159/","contentSize":"205533 B","width":1907,"height":641,"cDNContentUrl":"https://th.bing.com/th/id/R.bfd1c14fb82bc940254e700938feb9b1?rik=zc7rOBfkQEUouw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"46E96B57F184CD52E655BB284540E41738EBCECD","accentColor":"0094CC"},"CD44E4FF16E9EE4AA960303EF2BA4E0B1B085955":{"name":"AI Unit 2: Search Algorithms - Random, Depth, and Heuristic Techniques ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.4RW_RZZn51Dxsu7CGeCC2wHaJl?pid=Api","datePublished":"2025-12-30T04:44:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/9df4d41a987bb95e79ddbc22dcb8ce58/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/thiruvalluvar-university/bcacomputer-application/ai-unit-2-search-algorithms-random-depth-and-heuristic-techniques/149869770","contentSize":"285095 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.e115bf459667e750f1b2eec219e082db?rik=3ERO%2f2Ge7qSaBg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"559580B1B0E4AB2FE303069AA4EE9E61FF4E44DC","accentColor":"00933B"},"7ED8C82D2330CC2679DDED69AB3DE0F4B9FC8820":{"name":"Stacks | Learn Everything about Stacks in DSA","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.uROZZrptm-9_IBTSxnT9BAHaE5?pid=Api","datePublished":"2023-01-23T17:10:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://talentbattle.in/Files/C4U_Images/C4U_CKEDITOR_IMAGES/IMG10951_stacks.png","hostPageUrl":"https://talentbattle.in/learn-data-structures-and-algorithms-for-free/stacks","contentSize":"74140 B","width":586,"height":387,"cDNContentUrl":"https://th.bing.com/th/id/R.b9139966ba6d9bef7f2014d2c674fd04?rik=542M0jIDzGKX3Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0288CF9B4F0ED3BA96DEDD9762CC0332D28C8DE7","accentColor":"60636B"},"9324E9F8C0483C4BA3E8FC38D5D1456F166D190C":{"name":"QUESTION 4: (5 marks) Use Breadth First Search and Depth First Search ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.HDtd2F3UivBrn2iYN7Op8QAAAA?pid=Api","datePublished":"2024-01-17T11:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d7b/9997940a58d30bb8661156a22d8f66af.jpg","hostPageUrl":"https://brainly.in/question/59425908","contentSize":"16342 B","width":428,"height":451,"cDNContentUrl":"https://th.bing.com/th/id/R.1c3b5dd85dd48af06b9f689837b3a9f1?rik=OUKejwyEw7Q6jg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C091D661F6541D5D83CF8E3AB4C3840C8F9E4239","accentColor":"263949"},"7067B979031D8D7D8A44D9F1C7CE6AFF725FE75B":{"name":"A.I Lab write-ups - Experiment No.: 01 Aim: - Implement the Depth First ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.dgX6RBV2MzG0BWoQ1zlhdwHaJl?pid=Api","datePublished":"2024-05-27T12:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/93927ce27a51fc33d0d4f756d1e6641d/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/ai-lab-write-ups/91939914","contentSize":"350341 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.7605fa4415763331b4056a10d7396177?rik=B3ablzDR2NeoRA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B57EF527FFA6EC7C1F9D44A8D7D8D130979B7607","accentColor":"610DBE"},"373EF6D599AC27646590BF57CBD35F40CE65CA7D":{"name":"Data Structures and Algorithms in Python : Michael T. Goodrich, Roberto ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.HdER_JF1EC0uM0FZWFuj3QHaJo?pid=Api","datePublished":"2017-10-18T23:46:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://m.media-amazon.com/images/I/71sMkUcfhQL._SL1000_.jpg","hostPageUrl":"https://www.amazon.in/Structures-Algorithms-Python-Michael-Goodrich/dp/812656217X","contentSize":"145819 B","width":769,"height":1000,"cDNContentUrl":"https://th.bing.com/th/id/R.1dd111fc9175102d2e334159585ba3dd?rik=c%2bNvXZnKckZWCQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D7AC56EC04F53DBC75FB09564672CA995D6FE373","accentColor":"B74114"},"792095225DC083E1CC653A8378C6F88B70344706":{"name":"Mathematics n6YKk9h - aertaert - Introduction Mathematics is the ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.Kept6Y2y6l-2n9LuBUaChQHaKe?pid=Api","datePublished":"2023-08-28T15:29:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/1066297e790cea4b9283cc14f4cd9fad/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/mathematics-n6ykk9h-aertaert/39100299","contentSize":"558392 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.29ea6de98db2ea5fb69fd2ee05468285?rik=lwJZItUMOB7MVg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"60744307B88F6C8738A356CC1E380CD522590297","accentColor":"2B2526"},"EDDA7A6A38F1B7DA515AC887D52617C65A83977E":{"name":"BFS (Breadth-first search) Algorithm - Algorithms - Computer Science ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.9dtJACyOw4hb1lAijulMUQHaBv?pid=Api","datePublished":"2022-11-28T18:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/1611931_182afef7-b288-43ab-be50-75f013250498_lg.png","hostPageUrl":"https://edurev.in/t/248464/BFS--Breadth-first-search--Algorithm","contentSize":"21874 B","width":925,"height":218,"cDNContentUrl":"https://th.bing.com/th/id/R.f5db49002c8ec3885bd650228ee94c51?rik=3q2npoMfe60VpQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E77938A56C71625D788CA515AD7B1F83A6A7ADDE","accentColor":"585252"},"642CD2772C462E243B4EB7555D89732DF7D2BF1D":{"name":"Study Glance | Programming for Problem Solving Lab Manual(Programs)","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.5OF02X0obF8FayqnvcgSOgHaJ_?pid=Api","datePublished":"2025-07-15T08:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://studyglance.in/labprograms/PPS/images/compound-interest.jpeg","hostPageUrl":"https://studyglance.in/labprograms/ppsdisplay.php?url1=PPS/simple-compound-interest-c-program.html&title=Write%20the%20program%20for%20the%20simple,%20compound%20interest","contentSize":"219612 B","width":2083,"height":2809,"cDNContentUrl":"https://th.bing.com/th/id/R.e4e174d97d286c5f056b2aa7bdc8123a?rik=RsItd8Jk4kKz5A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D1FB2D7FD23798D5557BE4B342E264C2772DC246","accentColor":"AC7D1F"},"6B5295FF9BF3DF45F50300EEB328F6D85F5DB32F":{"name":"Question Bank EC-II - agtragra - University of Mumbai Program: _First ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.McJA3fziJEV2ApIZI3AjGQHaKe?pid=Api","datePublished":"2023-03-20T06:50:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/81a616fc4530bc3c132e35c32899685f/thumb_1200_1697.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/question-bank-ec-ii-agtragra/39098971","contentSize":"226851 B","width":1200,"height":1697,"cDNContentUrl":"https://th.bing.com/th/id/R.31c240ddfce224457602921923702319?rik=tiVZ%2f7k%2f%2fVRfMA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F23BD5F58D6F823BEE00305F54FD3FB9FF5925B6","accentColor":"A32828"},"DE6F3E328E7FE1D958DEE1A9ED7DE00B11F69D2E":{"name":"WEEK 1- Discipline AND Ideas IN Socialsciences - NAME: - Studocu","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.GiixrV_vGENQneY28zeRQgHaLU?pid=Api","datePublished":"2023-03-20T06:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/ab0d06460af5ef4cc6c6c215083c0a43/thumb_1200_1835.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/week-1-discipline-and-ideas-in-socialsciences/38602451","contentSize":"1104965 B","width":1200,"height":1835,"cDNContentUrl":"https://th.bing.com/th/id/R.1a28b1ad5fef1843509de636f3379142?rik=7fbjI%2bj3Hp2F7Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E2D96F11B00ED7DE9A1EED859D1EF7E823E3F6ED","accentColor":"CCCC00"},"4ECE54DAF98D751F60A172A9459C4BD41069721B":{"name":"12 IP Project - INFORMATICS PRACTICES ( 065 ) PROJECT ON – ‘’Worst ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.Je-F_IXrJaC9cpGUcb5vpwHaJl?pid=Api","datePublished":"2023-11-03T04:54:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/2560a949b177c744b431ba5723df4234/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/12-ip-project/71126998","contentSize":"2481800 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.25ef85fc85eb25a0bd72919471be6fa7?rik=5OxFrZ%2fYV%2fEGGg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B12796014DB4C9549A271A06F157D89FAD45ECE4","accentColor":"C5060A"},"F8ADC0010A3C977D32D70D8C40E2D92C5FC8E74C":{"name":"Algorithms: DFS Traversal","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.nvVU9IyaSXI4hxmnudaZegAAAA?pid=Api","datePublished":"2018-05-07T04:26:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=7159189216465345956","hostPageUrl":"https://gateoverflow.in/193326/dfs-traversal","contentSize":"7168 B","width":312,"height":160,"cDNContentUrl":"https://th.bing.com/th/id/R.9ef554f48c9a4972388719a7b9d6997a?rik=j9oMEKDDedcjfQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C47E8CF5C29D2E04C8D07D23D779C3A0100CDA8F","accentColor":"3D708E"},"CF89F1E5802AECCFFF296F55AD4E9516DF94EDEC":{"name":"Virtual Labs","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.iRvGKWeB8JAqnj8TSSDVIwHaDy?pid=Api","datePublished":"2021-03-23T15:44:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/images/undirected.png","hostPageUrl":"https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/basics-of-graphs.html","contentSize":"100920 B","width":1616,"height":826,"cDNContentUrl":"https://th.bing.com/th/id/R.891bc6296781f0902a9e3f134920d523?rik=%2fJgfXgiizvz%2fkg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"CEDE49FD6159E4DA55F692FFFCCEA2085E1F98FC","accentColor":"2271A9"},"768B9BBDAB1B1A635A3B77D5C60F64AE39878EB6":{"name":"Unit II: Search Algorithms in AI - Random, Depth, and Heuristic Methods ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.rcjsD3xZS8aj5sYGuU2IpAHaFO?pid=Api","datePublished":"2026-02-04T08:16:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/fe0417bf55403ee53e274217650e753a/thumb_1200_848.png","hostPageUrl":"https://www.studocu.com/in/document/alagappa-university/artificial-intelligence/unit-ii-search-algorithms-in-ai-random-depth-and-heuristic-methods/152686514","contentSize":"68480 B","width":1200,"height":848,"cDNContentUrl":"https://th.bing.com/th/id/R.adc8ec0f7c594bc6a3e6c606b94d88a4?rik=Z7i527qxoTalsw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"6BE87893EA46F06C5D77B3A536A1B1BADBB9B867","accentColor":"252525"},"ACAB20C807173698C79EC887D52617C65A83977E":{"name":"BFS (Breadth-first search) Algorithm - Algorithms - Computer Science ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.4HOcdm_bd_oTJsHRlI-3swAAAA?pid=Api","datePublished":"2022-11-28T18:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/1611931_3270b03b-cb1b-4402-abce-6e9e1281de36_lg.png","hostPageUrl":"https://edurev.in/t/248464/BFS--Breadth-first-search--Algorithm","contentSize":"13024 B","width":248,"height":276,"cDNContentUrl":"https://th.bing.com/th/id/R.e0739c766fdb77fa1326c1d1948fb7b3?rik=yroCjHBxY4l86Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E77938A56C71625D788CE97C896371708C02BACA","accentColor":"666666"},"550ADDD071B00F10DCCF91C50A2269C283A030A7":{"name":"Ai Practicals - Prac 1 :- Implement depth first search algorithm and ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.oFkN0e2Fochi1YniRIIf8AAAAA?pid=Api","datePublished":"2023-12-31T07:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/aca4922ca85d89a0aeea18ae684eff2f/thumb_300_388.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/artificial-intelligence-and-robotics/ai-practicals/77507591","contentSize":"39617 B","width":300,"height":388,"cDNContentUrl":"https://th.bing.com/th/id/R.a0590dd1ed85a1c862d589e244821ff0?rik=VaDdDRcL8AHN%2fA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7A030A382C9622A05C19FCCD01F00B170DDDA055","accentColor":"1210BB"},"576E3A47DBC98C432DE78E419D97F1329CC09E31":{"name":"Modern Statistics: Intuition, Math, Python, R eBook : Cohen, Mike ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.WX3880PjlN81sy5h03LMkQHaL2?pid=Api","datePublished":"2025-07-07T08:34:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://m.media-amazon.com/images/I/61V2KLFTOeL._SL1000_.jpg","hostPageUrl":"https://www.amazon.in/Modern-Statistics-Intuition-Math-Python-ebook/dp/B0CQV82FRT","contentSize":"71400 B","width":625,"height":1000,"cDNContentUrl":"https://th.bing.com/th/id/R.597dfcf343e394df35b32e61d372cc91?rik=deajdL2cyDTSfg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"13E90CC9231F79D914E87ED234C89CBD74A3E675","accentColor":"B14C1A"},"04857C73C40420485296040676AFF83D68197C3A":{"name":"Understanding depth-first search","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.cTL0noXTxwbieg9M17YW7AHaEC?pid=Api","datePublished":"2022-12-28T19:12:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d12aarmt01l54a.cloudfront.net/cms/images/Media-20221228185007/808-440.png","hostPageUrl":"https://indiaai.gov.in/article/understanding-depth-first-search","contentSize":"55882 B","width":808,"height":440,"cDNContentUrl":"https://th.bing.com/th/id/R.7132f49e85d3c706e27a0f4cd7b616ec?rik=QFjHN0xAAoQlaQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A3C79186D38FFA67604069258402404C37C75840","accentColor":"603218"},"66C7E91231711AD18E43A326592DB59755391C53":{"name":"A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.riuF7AqaLb7Wr_U4cuM23AHaDc?pid=Api","datePublished":"2023-01-08T10:12:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.mdpi.com/mathematics/mathematics-11-00327/article_deploy/html/images/mathematics-11-00327-g003.png","hostPageUrl":"https://www.mdpi.com/2227-7390/11/2/327","contentSize":"10971 B","width":2868,"height":1335,"cDNContentUrl":"https://th.bing.com/th/id/R.ae2b85ec0a9a2dbed6aff53872e336dc?rik=ZnyeIRMXoR3oNA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"35C19355795BD295623A34E81DA11713219E7C66","accentColor":"CC0000"},"1176ECC2717568770341B57E05282F77F8661726":{"name":"Rohit - noth - Experiment No. 3 Simple Reflex Agent Vacuum Cleaner Aim ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.2S7t-Yj69g1W51bFg_c0_gHaJl?pid=Api","datePublished":"2024-03-22T03:44:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/b4ba953e7ddbd9c44978b8084df52a28/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/rohit-noth/86907473","contentSize":"202283 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.d92eedf988faf60d56e756c583f734fe?rik=EWfOLBdXhncwFA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"6271668F77F28250E75B1430778657172CCE6711","accentColor":"6A6661"},"07EDCDECB14FE08FE9BD75263149CAA36C1FC613":{"name":"MC Module 2 Question Bank - St Francis Institute of Technology TE A ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.ppmubsRXre5R8FaTJxXyTQHaJl?pid=Api","datePublished":"2023-11-09T11:58:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/8255fa4546d43c9a32857a8a5bec08b7/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/mc-module-2-question-bank/58176444","contentSize":"387526 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.a699ae6ec457adee51f056932715f24d?rik=cN7czhv0Dvie2w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"316CF1C63AAC94136257DB9EF80EF41BCEDCDE70","accentColor":"424452"},"5AF461424C1B884698B77EFA8B6563F5C8B87BAA":{"name":"Dbms Lecture Notes - Artificial Intelligence - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.JzKgPJJJvwH4WVPdgQanLgHaJl?pid=Api","datePublished":"2022-05-21T08:54:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/09299e87f177db83a24b78d652972547/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/dbms-lecture-notes/26510774","contentSize":"984861 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.2732a03c9249bf01f85953dd8106a72e?rik=pU8WJMSxiGSJew&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AAB78B8C5F3656B8AFE77B896488B1C424164FA5","accentColor":"3A6F91"},"EF731C8D0A3B24059C276A609448AA1FDAD102F9":{"name":"Depth First Search In Data Structure - Depth First Search (DFS ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.TxjuJeOJbRGBFxy2LNiTOQHaKe?pid=Api","datePublished":"2022-07-22T21:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/56c3b07a6efed18264bed1275bee40ea/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/btech/depth-first-search-in-data-structure/22644172","contentSize":"174685 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.4f18ee25e3896d1181171cb62cd89339?rik=%2fjfB2KCzQlDJcg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9F201DADF1AA844906A672C95042B3A0D8C137FE","accentColor":"454545"},"DD3A5ACD5657422D745F2569DD9149EFE14F7AA7":{"name":"Question Bank PCE - reg - University of Mumbai Program: _First Year ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.Ci5xrTyMqd3xPpRfB86EDAAAAA?pid=Api","datePublished":"2022-11-29T18:48:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/b1c01902a18a3885a625b7dc189a90bc/thumb_300_388.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/question-bank-pce-reg/39098963","contentSize":"49276 B","width":300,"height":388,"cDNContentUrl":"https://th.bing.com/th/id/R.0a2e71ad3c8ca9ddf13e945f07ce840c?rik=3aOl3GV1JNJH9Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7AA7F41EFE9419DD9652F547D2247565DCA5A3DD","accentColor":"089340"},"989B069AA7AB45DCFDF8EF6F5CADFA582B9FADFA":{"name":"Linear Search Algorithm - Python Programming (P2 Python) - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.UPTtb8N-HZ1B2Nfw4dJ7TgHaJl?pid=Api","datePublished":"2023-03-17T05:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/cec39b0f990589d52e6dfa2587bdb567/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/cmr-university/python-programming-p2-python/linear-search-algorithm/42776462","contentSize":"538274 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.50f4ed6fc37e1d9d41d8d7f0e1d27b4e?rik=iblgqXq6VM3fjw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AFDAF9B285AFDAC5F6FE8FDFCD54BA7AA960B989","accentColor":"CC0000"},"639662088D21D4B4EDC318804EA6A5A43F7E1D88":{"name":"Aprende los Conceptos Básicos y Avanzados de Python en 30 minutos ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.6JOpShMxFKlYFiB6GrSDXgHaE8?pid=Api","datePublished":"2024-03-03T17:34:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://informaticoalrescate.com/wp-content/uploads/2024/03/python-scaled.webp","hostPageUrl":"https://informaticoalrescate.com/2024/03/03/aprende-los-conceptos-basicos-y-avanzados-de-python-en-30-minutos/","contentSize":"201106 B","width":2560,"height":1707,"cDNContentUrl":"https://th.bing.com/th/id/R.e893a94a133114a95816207a1ab4835e?rik=NmkmgNgSTUvePA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"88D1E7F34A5A6AE408813CDE4B4D12D880266936","accentColor":"0069CC"},"B034B0AA39BFCD8EB3401FB7609E7332FF8B1F52":{"name":"2021 October IAT1 Ques Paper Solution PCOM-2021 - St. Francis Institute ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.dgLr53vSmnkgeOPRqeivgQHaJl?pid=Api","datePublished":"2023-01-14T10:20:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/eb811dabbfe0f8f78fa202ddd302eb42/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/2021-october-iat1-ques-paper-solution-pcom-2021/34611732","contentSize":"313307 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.7602ebe77bd29a792078e3d1a9e8af81?rik=C0MLqpP73Og7BA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"25F1B8FF2337E9067BF1043BE8DCFB93AA0B430B","accentColor":"C5C506"},"2F93481BE68B5D0636397D25C7D62F9F9D45822D":{"name":"Quick Sort Algorithm implimentation in Python, Java with Examples","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.xHnGFSEs_PprPK9T-iHRzAHaD1?pid=Api","datePublished":"2024-06-20T15:28:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://lh7-us.googleusercontent.com/docsz/AD_4nXd_VD-PkxcpHnLp5ZJrgUXyIgh1ln6thyBna__49yH3YrOFSWdkcc2Qh8Lxf74uIcfnkpTWkump1uHsXt8HUBi2p4DpNRy43GStHkxkxr0e9E8hVx8Lpszk3rcO9yVUSd1-7BJUsaLsB6pNM5_70uOYNTw_?key=3_UPicvf_BgAHhUYi-MqCw","hostPageUrl":"https://neptuneworld.in/blog/quick-sort-algorithm-implimentation-python-java-examples/","contentSize":"27789 B","width":547,"height":283,"cDNContentUrl":"https://th.bing.com/th/id/R.c479c615212cfcfa6b3caf53fa21d1cc?rik=8jmEsW641WBjkw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D22854D9F9F26D7C52D7936360D5B86EB18439F2","accentColor":"0F374D"}},"relatedSearches":[{"text":"DFS Algorithm","displayText":"DFS Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5830.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Algorithm","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=DFS+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS DFS Graph","displayText":"BFS DFS Graph","webSearchUrl":"https://www.bing.com/images/search?q=BFS+DFS+Graph&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5832.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+DFS+Graph","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+DFS+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS vs DFS Algorithm","displayText":"BFS vs DFS Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=BFS+vs+DFS+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5834.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+vs+DFS+Algorithm","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+vs+DFS+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Traversal","displayText":"BFS Traversal","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Traversal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5836.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Traversal","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+Traversal&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS and DFS Differences","displayText":"BFS and DFS Differences","webSearchUrl":"https://www.bing.com/images/search?q=BFS+and+DFS+Differences&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5838.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Differences","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+and+DFS+Differences&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS and DFS Tree","displayText":"BFS and DFS Tree","webSearchUrl":"https://www.bing.com/images/search?q=BFS+and+DFS+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5840.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Tree","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+and+DFS+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Recursive DFS","displayText":"Recursive DFS","webSearchUrl":"https://www.bing.com/images/search?q=Recursive+DFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5842.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Recursive+DFS","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Recursive+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Algorithm Example","displayText":"BFS Algorithm Example","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Algorithm+Example&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5844.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Algorithm+Example","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+Algorithm+Example&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"What Is BFS and DFS","displayText":"What Is BFS and DFS","webSearchUrl":"https://www.bing.com/images/search?q=What+Is+BFS+and+DFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5846.1","searchLink":"https://www.bing.com/api/v7/images/search?q=What+Is+BFS+and+DFS","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=What+Is+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Difference Between BFS and DFS","displayText":"Difference Between BFS and DFS","webSearchUrl":"https://www.bing.com/images/search?q=Difference+Between+BFS+and+DFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5848.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Difference+Between+BFS+and+DFS","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Difference+Between+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Pseudocode","displayText":"BFS Pseudocode","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Pseudocode&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5850.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Pseudocode","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=BFS+Pseudocode&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Depth First Search Algorithm","displayText":"Depth First Search Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=Depth+First+Search+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5852.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Depth+First+Search+Algorithm","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Depth+First+Search+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Algo","displayText":"DFS Algo","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Algo&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5854.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Algo","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=DFS+Algo&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Ai BFS","displayText":"Ai BFS","webSearchUrl":"https://www.bing.com/images/search?q=Ai+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5856.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Ai+BFS","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Ai+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Diff Between DFS and BFS","displayText":"Diff Between DFS and BFS","webSearchUrl":"https://www.bing.com/images/search?q=Diff+Between+DFS+and+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5858.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Diff+Between+DFS+and+BFS","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Diff+Between+DFS+and+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS and DFS in Data Structure","displayText":"BFS and DFS in Data Structure","webSearchUrl":"https://www.bing.com/images/search?q=BFS+and+DFS+in+Data+Structure&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5860.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+in+Data+Structure","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+and+DFS+in+Data+Structure&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Graph Search Algorithms","displayText":"Graph Search Algorithms","webSearchUrl":"https://www.bing.com/images/search?q=Graph+Search+Algorithms&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5862.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Graph+Search+Algorithms","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Graph+Search+Algorithms&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Breadth First Search and Depth First Search","displayText":"Breadth First Search and Depth First Search","webSearchUrl":"https://www.bing.com/images/search?q=Breadth+First+Search+and+Depth+First+Search&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5864.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Breadth+First+Search+and+Depth+First+Search","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Breadth+First+Search+and+Depth+First+Search&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Time Complexity of BFS","displayText":"Time Complexity of BFS","webSearchUrl":"https://www.bing.com/images/search?q=Time+Complexity+of+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5866.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Time+Complexity+of+BFS","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Time+Complexity+of+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Python DFS BFS","displayText":"Python DFS BFS","webSearchUrl":"https://www.bing.com/images/search?q=Python+DFS+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5868.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Python+DFS+BFS","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Python+DFS+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Stack","displayText":"DFS Stack","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Stack&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5870.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Stack","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=DFS+Stack&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Applications of BFS and DFS","displayText":"Applications of BFS and DFS","webSearchUrl":"https://www.bing.com/images/search?q=Applications+of+BFS+and+DFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5872.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Applications+of+BFS+and+DFS","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Applications+of+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Compare BFS and DFS","displayText":"Compare BFS and DFS","webSearchUrl":"https://www.bing.com/images/search?q=Compare+BFS+and+DFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5874.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Compare+BFS+and+DFS","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Compare+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS and BFS Problem","displayText":"DFS and BFS Problem","webSearchUrl":"https://www.bing.com/images/search?q=DFS+and+BFS+Problem&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5876.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+and+BFS+Problem","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=DFS+and+BFS+Problem&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Runtime","displayText":"DFS Runtime","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Runtime&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5878.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Runtime","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=DFS+Runtime&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS vs Dijkstra","displayText":"BFS vs Dijkstra","webSearchUrl":"https://www.bing.com/images/search?q=BFS+vs+Dijkstra&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5880.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+vs+Dijkstra","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+vs+Dijkstra&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Algorithm in C++","displayText":"BFS Algorithm in C++","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Algorithm+in+C%2b%2b&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5882.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Algorithm+in+C%2b%2b","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=BFS+Algorithm+in+C%2b%2b&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Algorithm Question","displayText":"BFS Algorithm Question","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Algorithm+Question&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5884.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Algorithm+Question","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=BFS+Algorithm+Question&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS and DFS Algorithm in Discrete Mathematics","displayText":"BFS and DFS Algorithm in Discrete Mathematics","webSearchUrl":"https://www.bing.com/images/search?q=BFS+and+DFS+Algorithm+in+Discrete+Mathematics&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5886.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Algorithm+in+Discrete+Mathematics","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+and+DFS+Algorithm+in+Discrete+Mathematics&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS M DFS Graph","displayText":"BFS M DFS Graph","webSearchUrl":"https://www.bing.com/images/search?q=BFS+M+DFS+Graph&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5888.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+M+DFS+Graph","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+M+DFS+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS DFS Flowchart","displayText":"BFS DFS Flowchart","webSearchUrl":"https://www.bing.com/images/search?q=BFS+DFS+Flowchart&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5890.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+DFS+Flowchart","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+DFS+Flowchart&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Matrix","displayText":"BFS Matrix","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Matrix&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5892.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Matrix","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+Matrix&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Y BFS","displayText":"DFS Y BFS","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Y+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5894.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Y+BFS","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=DFS+Y+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS N BFS Algorithm","displayText":"DFS N BFS Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=DFS+N+BFS+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5896.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+N+BFS+Algorithm","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=DFS+N+BFS+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Application","displayText":"DFS Application","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Application&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5898.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Application","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=DFS+Application&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Simple BFS Algorithm","displayText":"Simple BFS Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=Simple+BFS+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5900.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Simple+BFS+Algorithm","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Simple+BFS+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS DFS in Graph Theory","displayText":"BFS DFS in Graph Theory","webSearchUrl":"https://www.bing.com/images/search?q=BFS+DFS+in+Graph+Theory&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5902.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+DFS+in+Graph+Theory","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+DFS+in+Graph+Theory&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"UCS Graph","displayText":"UCS Graph","webSearchUrl":"https://www.bing.com/images/search?q=UCS+Graph&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5904.1","searchLink":"https://www.bing.com/api/v7/images/search?q=UCS+Graph","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=UCS+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS and DFS Sums","displayText":"BFS and DFS Sums","webSearchUrl":"https://www.bing.com/images/search?q=BFS+and+DFS+Sums&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5906.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Sums","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+and+DFS+Sums&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Visualization","displayText":"DFS Visualization","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Visualization&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5908.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Visualization","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=DFS+Visualization&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Undirected Graph BFS","displayText":"Undirected Graph BFS","webSearchUrl":"https://www.bing.com/images/search?q=Undirected+Graph+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5910.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Undirected+Graph+BFS","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Undirected+Graph+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Dan DFS","displayText":"BFS Dan DFS","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Dan+DFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5912.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Dan+DFS","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+Dan+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Pseudocode","displayText":"DFS Pseudocode","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Pseudocode&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5914.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Pseudocode","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=DFS+Pseudocode&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Search","displayText":"DFS Search","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Search&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5916.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Search","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=DFS+Search&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS DFS Difference","displayText":"BFS DFS Difference","webSearchUrl":"https://www.bing.com/images/search?q=BFS+DFS+Difference&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5918.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+DFS+Difference","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+DFS+Difference&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"What Is DFS and BFS","displayText":"What Is DFS and BFS","webSearchUrl":"https://www.bing.com/images/search?q=What+Is+DFS+and+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5920.1","searchLink":"https://www.bing.com/api/v7/images/search?q=What+Is+DFS+and+BFS","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=What+Is+DFS+and+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Code","displayText":"DFS Code","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Code&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5922.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Code","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=DFS+Code&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Animation","displayText":"BFS Animation","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Animation&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5924.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Animation","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+Animation&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS and DFS Examples","displayText":"BFS and DFS Examples","webSearchUrl":"https://www.bing.com/images/search?q=BFS+and+DFS+Examples&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5926.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Examples","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+and+DFS+Examples&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Example of BFS and DFS","displayText":"Example of BFS and DFS","webSearchUrl":"https://www.bing.com/images/search?q=Example+of+BFS+and+DFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5928.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Example+of+BFS+and+DFS","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Example+of+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}}],"createdate":1778029978171}
[curl_error] =>
[product_name_used] => Bfs-And-Dfs-Algorithm-Python
[parsed] => Array
(
[name] => bfs-and-dfs-algorithm-python inr loc:in
[totalEstimatedMatches] => 160
[nextOffset] => 120
[currentOffset] => 0
[value] => Array
(
[043D0000750F21D035354C9A0BFF77ED2A6095C8] => Array
(
[name] => Practical 1 - SSXS: Implementing DFS & BFS Algorithms in Python - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.xvZEJep5_wF-Oo82Jl5qNQHaKd?pid=Api
[datePublished] => 2025-09-22T20:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/c1d1cb5f5682d68c0b80e12411624a5b/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-mumbai/tybsc-physics-mathematical-methods-in-physics/practical-1-ssxs-implementing-dfs-bfs-algorithms-in-python/139277905
[contentSize] => 291373 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.c6f64425ea79ff017e3a8f36265e6a35?rik=QNMAAFfwEg1TUw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 8C5906A2DE77FFB0A9C453530D12F0570000D340
[accentColor] => 2F2F2F
)
[6612559C54AD0FCEC706150F749E48AB5D2E06FB] => Array
(
[name] => Experiment No1 and 2: Implementing BFS and DFS Algorithms in Python ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.e8XdK-aQ0fZerJ9wXyEpmwHaJl?pid=Api
[datePublished] => 2025-05-05T00:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/c850189c29d3a0c5644b56eb77dafe28/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/jawaharlal-nehru-technological-university-hyderabad-college-of-engineering-sultanpur/computer-science-and-engineering/experiment-no1-and-2-implementing-bfs-and-dfs-algorithms-in-python/125361400
[contentSize] => 402400 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.7bc5dd2be690d1f65eac9f705f21299b?rik=ZiFVyUXa8Ox8YA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => BF60E2D5BA84E947F051607CECF0DA45C9552166
[accentColor] => B0561B
)
[EB478C1657FF83F9BFB1E34379BD674DECEB38A9] => Array
(
[name] => AI Lab Manual: BFS & DFS Algorithms with Python Implementations - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.2Ta7IDj5sTg6RGQu4Sn9HQHaJl?pid=Api
[datePublished] => 2026-02-06T11:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/627ec2ef8b569560a6007e53ee3c0900/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/teegala-krishna-reddy-engineering-college/computer-science-engineering/ai-lab-manual-bfs-dfs-algorithms-with-python-implementations/152870286
[contentSize] => 142305 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.d936bb2038f9b1383a44642ee129fd1d?rik=vnTIYXX%2fOJ%2f7Gw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9A83BECED476DB97343E1BFB9F38FF7561C874BE
[accentColor] => 454545
)
[5B65FE59B524CD2354FFD63CD178548A18E12FBF] => Array
(
[name] => Implement DFS and BFS Search Algorithm - 1. Implement DFS and BFS ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.aHdlKoMlDeiJons4PpnmhgHaJl?pid=Api
[datePublished] => 2024-05-16T18:36:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/1c65db5fcb18b31dac132c0a144e22b8/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/dr-ambedkar-institute-of-technology/electronics-engineering/implement-dfs-and-bfs-search-algorithm/93621408
[contentSize] => 69775 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.6877652a83250de889a27b383e99e686?rik=tVbvlVtC3DJF%2fw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => FBF21E81A845871DC36DFF4532DC425B95EF56B5
[accentColor] => 484848
)
[0A9ED709DCA2C8B74A0E1C5B12C569E182AF488F] => Array
(
[name] => BFS AND DFS Comparison IN DATA Structures - BFS vs. DFS Before looking ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.0MyonPjzZG0Kpg_qPJABSAHaKe?pid=Api
[datePublished] => 2022-06-25T06:41:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/ed0dc8092aee1305883f01e0a3475f37/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/btech/bfs-and-dfs-comparison-in-data-structures/22769251
[contentSize] => 225725 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.d0cca89cf8f3646d0aa60fea3c900148?rik=oOl9kM0qjHuk4A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F884FA281E965C21B5C1E0A47B8C2ACD907DE9A0
[accentColor] => 850B0B
)
[006C266EBD5C1716D289B0795796949CCE53C304] => Array
(
[name] => DFS vs. BFS: A Student’s Guide to Graph Traversal Algorithms
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.tzeWd514hbtYvHT441YMnwHaEK?pid=Api
[datePublished] => 2025-11-28T06:53:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.lingayasvidyapeeth.edu.in/sanmax/wp-content/uploads/2025/11/DFS-vs.-BFS.webp
[hostPageUrl] => https://www.lingayasvidyapeeth.edu.in/dfs-vs-bfs-a-students/
[contentSize] => 123276 B
[width] => 1200
[height] => 675
[cDNContentUrl] => https://th.bing.com/th/id/R.b73796779d7885bb58bc74f8e3560c9f?rik=AMZi5tvFcWEtmA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 403C35ECC9496975970B982D6171C5DBE662C600
[accentColor] => 0048AC
)
[6A8EF70896806BBF6A6D230AA42D41A3BD0B926C] => Array
(
[name] => AI Practical File: Search Algorithms (BFS, DFS, A*) Experiments - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.3ZCA-r3PDZI_7UkHZn1UmgHaJl?pid=Api
[datePublished] => 2025-06-10T19:38:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/3e1fc220c0eefebe780efa95bbd684ed/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/the-oxford-educational-institutions/healing-her-heart/ai-practical-file-search-algorithms-bfs-dfs-a-experiments/129257123
[contentSize] => 210971 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.dd9080fabdcf0d923fed4907667d549a?rik=puh%2fgGkItvum1g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C629B0DB3A14D24AA032D6A6FBB60869807FE8A6
[accentColor] => 3F638C
)
[D466BD06D592C13AB78A8D448B07B1017DA35D1C] => Array
(
[name] => AI Practical No. 2: Implementing BFS & DFS Search Algorithms - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.dS5mcNF4Ksdh9uQQQUw8FgHaKd?pid=Api
[datePublished] => 2025-07-08T00:41:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/1881ff7817b9b754e6e384f9f58996d9/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/artificial-intelligence-and-data-sciencecomputer-science-and-engineeringartificial-intelligence/ai-practical-no-2-implementing-bfs-dfs-search-algorithms/132881136
[contentSize] => 439668 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.752e6670d1782ac761f6e410414c3c16?rik=TWbbYF0pHKN7qA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C1D53AD7101B70B844D8A87BA31C295D60DB664D
[accentColor] => C2A909
)
[57EE0FAA071532C7694DBA6F7E18994902A9644F] => Array
(
[name] => Explain DFS and BFS with example | summer-2014
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.OvEFQpvcxXUSh-89DWaN9AAAAA?pid=Api
[datePublished] => 2020-12-26T17:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://gtu-paper-solution.com/upload/2130702/S2019/DFS_Example.png
[hostPageUrl] => https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2014/Question-4-a
[contentSize] => 24185 B
[width] => 406
[height] => 230
[cDNContentUrl] => https://th.bing.com/th/id/R.3af105429bdcc5751287ef3d0d668df4?rik=de7wqnBRI3yW1A&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fDFS_Example.png&ehk=azueXLkfjIxbKuTR1P6uchitrSbBRy1RK2xVFdJ7UKs%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F4469A20949981E7F6ABD4967C235170AAF0EE75
[accentColor] => 9A6C31
)
[D0541B5E2CB79DEFC6D17207F792F82723157C04] => Array
(
[name] => AI E1 - Experiment 1: Implementing BFS, DFS, and Logic Gates in Python ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.4XWNkgGn5WaQi52X7FQinAHaKd?pid=Api
[datePublished] => 2025-04-09T16:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/99397dfedd3cba1b658f988882747151/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/amity-university/artificial-intelligence/ai-e1-experiment-1-implementing-bfs-dfs-and-logic-gates-in-python/123321865
[contentSize] => 188258 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.e1758d9201a7e566908b9d97ec54229c?rik=DUWx5cJ72f5sHQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 40C75132728F297F70271D6CFED97BC2E5B1450D
[accentColor] => 494949
)
[AE2A68C7D0C1E3C00460ADF9E8B4DC3A2EE03252] => Array
(
[name] => Graph Algorithms: DFS and BFS Overview (CS101 Lecture Notes) - Studocu
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.MUcQsG5_eXB0Ro-jesVZqgHaJl?pid=Api
[datePublished] => 2026-01-29T02:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/a338a5b9674d2c7c4f2cfa2d486d2180/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/abes-engineering-college/machine-learning-techniques/graph-algorithms-dfs-and-bfs-overview-cs101-lecture-notes/152115128
[contentSize] => 183107 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.314710b06e7f797074468fa37ac559aa?rik=6qKGfA0cPgxABg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 25230EE2A3CD4B8E9FDA06400C3E1C0D7C86A2EA
[accentColor] => C99602
)
[26EA38F78CC013694AF86A66997B209B508DDF68] => Array
(
[name] => Search Algorithms in AI (Lab) - BFS, DFS, UCS, and More - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.bbbHU60mje7vNPDuTbyBiwHaKe?pid=Api
[datePublished] => 2026-02-09T17:13:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/2724aab7db950f478af5a507fc61b3dc/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/kalinga-institute-of-industrial-technology/python-programming-lab/search-algorithms-in-ai-lab-bfs-dfs-ucs-and-more/153015136
[contentSize] => 1128301 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.6db6c753ad268deeef34f0ee4dbc818b?rik=Yq6Df8gMMZakjw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 86FDD805B902B79966A68FA496310CC87F83AE62
[accentColor] => 137B6E
)
[4098B576B2CDDFDFBAB2420C505833B68B676A3C] => Array
(
[name] => Python Ass3-BFS-DFS - Python program to print DFS traversal from a ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.Xt7eSEtATey86U0C5M_7FQHaJl?pid=Api
[datePublished] => 2023-02-17T11:05:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/fdefe55d2a0db24043652868df405854/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/msccomputer-science/python-ass3-bfs-dfs/47289375
[contentSize] => 121751 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.5edede484b404decbce94d02e4cffb15?rik=BIlbZyvc%2ff2rKw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C3A676B86B338505C0242BABFDFDDC2B675B8904
[accentColor] => 414141
)
[0560B7BE2C1A49A7CF274EF52696E0F10C3AEF9F] => Array
(
[name] => BFS Algorithm and DFS algorithm Assignment - Data Analysis - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.hRq-npEVvnaPEx-v7tYGEgHaJl?pid=Api
[datePublished] => 2022-02-07T22:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/0c45435860c01e17ab18e75a7ae1b11c/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/amity-university/data-analysis/bfs-algorithm-and-dfs-algorithm-assignment/19465350
[contentSize] => 162847 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.851abe9e9115be768f131fafeed60612?rik=UAZ768KhlHr8cg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F9FEA3C01F0E69625FE472FC7A94A1C2EB7B0650
[accentColor] => 4A4A4A
)
[1AB08744676BC58AA8FE11F373863BFC4D6A9380] => Array
(
[name] => AIML 101: BFS and DFS Algorithms Overview and Analysis - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.wg6OaAX0qXSy_pWLOnYc6QHaEK?pid=Api
[datePublished] => 2025-11-16T09:04:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/7b6e917cbd2e7b24b7f8f5993fbf3062/thumb_784_441.png
[hostPageUrl] => https://www.studocu.com/in/document/anna-university/artificial-intelligence-and-data-science-ai-ds/aiml-101-bfs-and-dfs-algorithms-overview-and-analysis/145775275
[contentSize] => 59080 B
[width] => 784
[height] => 441
[cDNContentUrl] => https://th.bing.com/th/id/R.c20e8e6805f4a974b2fe958b3a761ce9?rik=oQt4RHa2XKiK7w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0839A6D4CFB368373F11EF8AA85CB67644780BA1
[accentColor] => 00CC52
)
[6EEA66ADA9B6356F1E33BA6F7E18994902A9644F] => Array
(
[name] => Explain DFS and BFS with example | summer-2014
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.X4p-jhXiN1G3L9RtLPzjuQAAAA?pid=Api
[datePublished] => 2020-12-26T17:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://gtu-paper-solution.com/upload/2130702/S2019/BFS_Example.png
[hostPageUrl] => https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2014/Question-4-a
[contentSize] => 7469 B
[width] => 381
[height] => 179
[cDNContentUrl] => https://th.bing.com/th/id/R.5f8a7e8e15e23751b72fd46d2cfce3b9?rik=5q5m2pprU%2fbhMw&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fBFS_Example.png&ehk=dra2N96gsHnbuXImuqLsn2s4aaZekXzIqw2zN81fHpE%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F4469A20949981E7F6AB33E1F6536B9ADA66AEE6
[accentColor] => 3C3C3C
)
[71BF8A03559F25D5ACF8A68D75BFC3F974BC2A45] => Array
(
[name] => BFS and DFS - it is helpful to students - DFS (Depth First Search ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.WBFGye3qVOaeHEUr6C8LQwHaJl?pid=Api
[datePublished] => 2024-03-02T03:48:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/b8d71775bdaaf3358a1b55696680e63f/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/bfs-and-dfs-it-is-helpful-to-students/85355166
[contentSize] => 300112 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.581146c9edea54e69e1c452be82f0b43?rik=F%2fuoMFX5Ul3Kjw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 54A2CB479F3CFB57D86A8FCA5D52F95530A8FB17
[accentColor] => 71264C
)
[78EBD237A4C0AC18975BCE2DAA9154C838343BBC] => Array
(
[name] => BFS and DFS Algorithms: Graph Traversal Techniques (CS101) - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.ZViJ9Mt4-cuPqIoHeP6-xQHaKe?pid=Api
[datePublished] => 2025-12-17T23:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/659ce9edcd1f15f60a3227ad5c9a9359/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/industrial-economics-and-foreign-trade/bfs-and-dfs-algorithms-graph-traversal-techniques-cs101/149128083
[contentSize] => 1498114 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.655889f4cb78f9cb8fa88a0778febec5?rik=h74tc0oMyoF5tQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => CBB343838C4519AAD2ECB57981CA0C4A732DBE87
[accentColor] => 874454
)
[B06EB5A6E334912E7409326483425C6BFA5A34DB] => Array
(
[name] => BFS and DFS Algorithms: Steps and Process Explanation - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.EtWOiAF9jNxonSsqj9hfUAHaKd?pid=Api
[datePublished] => 2023-11-11T07:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/68e65efd23a6ac65265b0873386515a0/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/biju-patnaik-university-of-technology/computer-networks/bfs-and-dfs/75452472
[contentSize] => 213301 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.12d58e88017d8cdc689d2b2a8fd85f50?rik=C%2bZbaj5DGeJHkA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => BD43A5AFB6C5243846239047E219433E6A5BE60B
[accentColor] => A72428
)
[978C678E6E8003368A8A6E8E02DF6B93FAA49762] => Array
(
[name] => Difference Between BFS, DFS, Best First Search, A-Star (A*) Algorithm
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.-333Mpv40Slz4zUp2OvwtwHaD4?pid=Api
[datePublished] => 2021-04-04T06:16:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg9HmB76CWlagJTY_h7VjxmDq54NHxCW5RxWqFISUTT_7CO2HljWVS15e-QhClnaAvcdAtpr3NMvuAppI3vLOSomgQfP2kCM-iKmOPbFFNj3xLtCXYEpsq0AP14gEtL_tiI4-QIkshvuNUz/w1200-h630-p-k-no-nu/Defference+Between+Search+Algorithm.jpg
[hostPageUrl] => https://www.fiedge.in/2020/03/difference-between-bfs-dfs-best-first_10.html
[contentSize] => 126559 B
[width] => 878
[height] => 461
[cDNContentUrl] => https://th.bing.com/th/id/R.fb7df7329bf8d12973e33529d8ebf0b7?rik=ech26OYIMGOoqA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 26794AAF39B6FD20E8E6A8A8633008E6E876C879
[accentColor] => 768D3E
)
[D8546B1EA5AC0F3CB74B22F97DAE82F9EDA33F64] => Array
(
[name] => DFS algorithm in Python - Python3 program to print DFS traversal from a ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.AKfdqP3pF8cHvWQMz8gC6QHaKe?pid=Api
[datePublished] => 2022-05-04T10:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/e35f79cdfa065538cd79fce27053e87f/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/information-technology/dfs-algorithm-in-python/24557353
[contentSize] => 278617 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.00a7dda8fde917c707bd640ccfc802e9?rik=jUW24VrK8MN7tA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 46F33ADE9F28EAD79F22B47BC3F0CA5AE1B6458D
[accentColor] => 0202C9
)
[BC1EA6D1D80CE100378CEE74C54A8DD2230E0F02] => Array
(
[name] => CS101: Algorithms - BFS, DFS, A*, Hill Climbing & Minimax Experiments ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.sxTHtqQ3NOlTXt3Zwvel9wHaJl?pid=Api
[datePublished] => 2026-01-09T06:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/8fa342f822c3ff73d421822a5fef7ce5/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/btech-cse-3rd-year/cs101-algorithms-bfs-dfs-a-hill-climbing-minimax-experiments/150417702
[contentSize] => 56708 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.b314c7b6a43734e9535eddd9c2f7a5f7?rik=y%2bFqHY3AHgBzyA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 20F0E0322DD8A45C47EEC873001EC08D1D6AE1CB
[accentColor] => 444444
)
[0AEA26B42A491327B15D264246D1E4FF55C0F1CA] => Array
(
[name] => BFS and DFS Algorithm Implementation - CED Lab Manual Exp. 3 - Studocu
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.ARpWkQF-lq3PfqQJAK1_iQHaJl?pid=Api
[datePublished] => 2022-03-01T06:58:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/310cf646c274735a878bdd2abe5d06c4/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/bfs-and-dfs-algorithm/23048132
[contentSize] => 169814 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.011a5691017e96adcf7ea40900ad7f89?rik=oK5iS6KUMXIb1Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AC1F0C55FF4E1D642462D51B723194A24B62AEA0
[accentColor] => 22A95A
)
[AE7A026DBE61460095659F54F09FB294F7731609] => Array
(
[name] => 21CS54 M1 PP - BFS & DFS Algorithms in Graph Traversal - Studocu
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.J52c3Mx2aNIqIhDgTN2tMAHaJl?pid=Api
[datePublished] => 2025-12-21T12:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/a5908971f50540c93fdf0815d49c10b8/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/visvesvaraya-technological-university/machine-learning/21cs54-m1-pp-bfs-dfs-algorithms-in-graph-traversal/149264763
[contentSize] => 147397 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.279d9cdccc7668d22a2210e04cddad30?rik=6qcg1usWZABZVg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9061377F492BF90F45F95659006416EBD620A7EA
[accentColor] => CC0000
)
[18B1B41E167D2F45EB497AFB78B67138BB92470B] => Array
(
[name] => AI Practical Codes: DFS & BFS Algorithms and Family Tree Example - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.ng9svkbAjHJdDYCJnI7DqgHaKd?pid=Api
[datePublished] => 2025-04-26T09:48:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/70056fdbbaa89197416b8ee30d1e599b/thumb_1200_1694.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-mumbai/computer-engineering/ai-practical-codes-dfs-bfs-algorithms-and-family-tree-example/124873710
[contentSize] => 72297 B
[width] => 1200
[height] => 1694
[cDNContentUrl] => https://th.bing.com/th/id/R.9e0f6cbe46c08c725d0d80899c8ec3aa?rik=gRtL4WHX8lS%2blA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B07429BB83176B87BFA794BE54F2D761E14B1B81
[accentColor] => 4C4C4C
)
[32BF45EB379064EB2BF01052B88B95F732616C18] => Array
(
[name] => BFS and DFS Algorithms - A Deep Dive in Data Structures - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.6e9wfntxwJ4IQRa1aJqnEwHaJl?pid=Api
[datePublished] => 2023-03-10T04:14:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/dd6f2e5977430d063debc368a25fae17/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/i-k-gujral-punjab-technical-university/bachelor-of-computer-applications/bfs-and-dfs-data-structures/49609720
[contentSize] => 228838 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.e9ef707e7b71c09e084116b5689aa713?rik=I%2ftUvnMJRr6yDw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 81C616237F59B88B25010FB2BE460973BE54FB23
[accentColor] => 844775
)
[D1212FE0752E0D3B3320EE714E025FB33A7155BA] => Array
(
[name] => BFS and DFS Algorithms - Practical Notes for Graph Search - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.uG1R80bFd6vY0bVImcYuugHaJl?pid=Api
[datePublished] => 2024-11-13T10:10:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/d4be58fbd7a4f4a5f2339fbf1eb31d74/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/adi-shankara-institute-of-engineering-technology/data-structures/bfs-dfs-example-practical-notes/110664527
[contentSize] => 186781 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.b86d51f346c577abd8d1b54899c62eba?rik=HRLyDlfi0LMzAg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AB5517A33BF520E417EE0233B3D0E2570EF2121D
[accentColor] => 994200
)
[9AC9BF1D6BBB78ABAC59B71215596FE80476DC01] => Array
(
[name] => BFS and DFS algorithm in C - BFS algorithm in C #include #include - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.N47UbkaZxNdd_GJPHJNZtAHaJl?pid=Api
[datePublished] => 2023-12-18T03:14:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/7a8ed187c32a12dced71cd28e421ef84/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/indian-institute-of-technology-indian-school-of-mines-dhanbad/mtech/bfs-and-dfs-algorithm-in-c/78059182
[contentSize] => 78760 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.378ed46e4699c4d75dfc624f1c9359b4?rik=qZz70ba7h7rKlQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 10CD67408EF69551217B95CABA87BBB6D1FB9CA9
[accentColor] => 666666
)
[E7D4E7E76C7748E737666C7ABD1EA9F4DECA7121] => Array
(
[name] => Practical Programs for Algorithms: Selection Sort, TSP, Knapsack, DFS ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.AsvzAut5EkE8Q-OLVQxozgHaJl?pid=Api
[datePublished] => 2026-01-15T22:13:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/a218d02ab364b5cfc119bc317b077fa4/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/bagalkot-university/design-and-analysis-of-algorithm/practical-programs-for-algorithms-selection-sort-tsp-knapsack-dfs-bfs-and/143485025
[contentSize] => 82205 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.02cbf302eb7912413c43e38b550c68ce?rik=fk1%2bfsZ3hH5zZg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 1217ACED4F9AE1DBA7C666737E8477C67E7E4D7E
[accentColor] => 4D4D4D
)
[8EFB8F41C89CF19041D32B38366BAC351A184CE1] => Array
(
[name] => AI BFS and DFS: Depth First Search Algorithm Overview - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.eaO6M4vqKR_Znaax1aDAZwHaKd?pid=Api
[datePublished] => 2026-01-03T09:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/1302718db48e91df98e26f670aed2a4d/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/prasad-v-potluri-siddhartha-institute-of-technology/information-technology/ai-bfs-and-dfs-depth-first-search-algorithm-overview/149991822
[contentSize] => 145886 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.79a3ba338bea291fd99da6b1d5a0c067?rik=6L%2f4FIzJHwkUPQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 1EC481A153CAB66383B23D14091FC98C14F8BFE8
[accentColor] => 464646
)
[58ACE77A7292BC399FF6A58A92FD72BC9232B6F2] => Array
(
[name] => Algorithm-1: BFS, DFS, Sorting & Graph Algorithms (CS101) - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.fU4muKDYnsCQht3avHt0-wHaJl?pid=Api
[datePublished] => 2025-10-15T06:58:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/14efff5dcbda6fdff79a089e610ab790/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/anna-university/computer-science-and-engineering/algorithm-1-bfs-dfs-sorting-graph-algorithms-cs101/141998237
[contentSize] => 218473 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.7d4e26b8a0d89ec09086dddabc7b74fb?rik=hcp%2bpycpy5P5bw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2F6B2329CB27DF29A85A6FF993CB2927A77ECA85
[accentColor] => 484848
)
[FD665CE31558D600669F2F9A76E6B7282DB032A1] => Array
(
[name] => Module 11: Advanced Data Structures and Algorithms - BFS, DFS, AVL ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.9lfUeoiljPmvEJ1ijv70hQHaKe?pid=Api
[datePublished] => 2025-05-06T05:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/6c6fb27ac13d59e1c63cc16e922dcf5d/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/algorithm-analysis-and-design/module-11-advanced-data-structures-and-algorithms-bfs-dfs-avl-trees/125941267
[contentSize] => 721944 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.f657d47a88a58cf9af109d628efef485?rik=32bFPlGFbQBm%2bQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 1A230BD2827B6E67A9F2F966006D85513EC566DF
[accentColor] => BD5E0E
)
[9F276A566DDF5CED2EF3EE55C130C38CE09F86A4] => Array
(
[name] => Practical Exercises on Uninformed Search Algorithms (BFS, DFS, A* ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.chVfpgpaivwMSnDzcSIklAHaKe?pid=Api
[datePublished] => 2025-02-07T03:36:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/435ed12edeba55203a3a264eb1cfc83d/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/srm-madurai-college-for-engineering-and-technology/soft-computing/doc-scanner-jan-21-2025-3-15-pm/117484327
[contentSize] => 652298 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.72155fa60a5a8afc0c4a70f371222494?rik=%2bXKmZdb9xd7iPw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4A68F90EC83C031C55EE3FE2DEC5FDD665A672F9
[accentColor] => 442D28
)
[C2C55FC191AF67B6EAFD74D5955ECDE07F2C702B] => Array
(
[name] => Depth First Search in Python (with Code) DFS Algorithm Fav Tutor ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.5WB9yhZvwHNUPO9qUALBJAHaKe?pid=Api
[datePublished] => 2024-02-28T22:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/7e9643114f01bf234844ffadf1df05b4/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-burdwan/population-geography/depth-first-search-in-python-with-code-dfs-algorithm-fav-tutor/84074232
[contentSize] => 340314 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.e5607dca166fc073543cef6a5002c124?rik=LFz1HBn6dmuu3w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B207C2F70EDCE5595D47DFAE6B76FA191CF55C2C
[accentColor] => BF6A0C
)
[0261055004FA11946F56C7D7C5DA8BF8A5201EF7] => Array
(
[name] => Water Jug Problem Solver: DFS & BFS Algorithms - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.OqUF3FcG8KCZe3p5aO_8SQHaEK?pid=Api
[datePublished] => 2025-11-15T08:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/a8d727f5cac697ee200873ad6e7c83ba/thumb_784_441.png
[hostPageUrl] => https://www.studocu.com/in/document/shanmugha-arts-science-technology-and-research-academy/computer-science/water-jug-problem-solver-dfs-bfs-algorithms/145684297
[contentSize] => 48871 B
[width] => 784
[height] => 441
[cDNContentUrl] => https://th.bing.com/th/id/R.3aa505dc5706f0a0997b7a7968effc49?rik=IBZQBUCvEUn2ZQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7FE1025A8FB8AD5C7D7C65F64911AF4005501620
[accentColor] => 444444
)
[42579D467560A37A25C55C1C15927685131F3852] => Array
(
[name] => AI-LAB: Water Jug Problem Solution Using DFS and BFS Algorithms - Studocu
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.uZVvYPpOAUg4N8klBTzASwHaKd?pid=Api
[datePublished] => 2024-08-22T17:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/0f3852ea6adbe2b9f6738e36ac826fb2/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/visvesvaraya-technological-university/artificial-intelligence/ai-lab-programs/102171976
[contentSize] => 177812 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.b9956f60fa4e01483837c925053cc04b?rik=JHXZZFcGOqdSXA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2583F13158672951C1C55C52A73A065764D97524
[accentColor] => 666666
)
[4397F9DDBB784F63E4AB067C142166BECD054858] => Array
(
[name] => DAA PYQ: Space & Time Complexity, BFS, DFS, and Sorting Algorithms ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.eVKojlykHNx-YBtUT5jzlQHaEK?pid=Api
[datePublished] => 2025-11-12T22:58:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/c630f0846047ba7c1c71b30aff177b90/thumb_784_441.png
[hostPageUrl] => https://www.studocu.com/in/document/bihar-engineering-university-patna/beu-btech-2-sem-engineering-graphics-design-pyq/daa-pyq-space-time-complexity-bfs-dfs-and-sorting-algorithms-2016-2020/145258084
[contentSize] => 336573 B
[width] => 784
[height] => 441
[cDNContentUrl] => https://th.bing.com/th/id/R.7952a88e5ca41cdc7e601b544f98f395?rik=NHmf3buH9DZOug&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 858450DCEB661241C760BA4E36F487BBDD9F7934
[accentColor] => 41456C
)
[58FD3C167BFD2AF991336F7E525E50FD6D190A22] => Array
(
[name] => Master BFS & DFS: Essential Graph Algorithms Explained –Notes
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.zy98Vkh2CvUB9Z0P5r-YuQHaE7?pid=Api
[datePublished] => 2025-07-08T19:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://notes.suhaib.in/images/featured/graph-traversals-mastering-bfs-and-dfs-3482441.jpg
[hostPageUrl] => https://notes.suhaib.in/docs/code/graph/theory/graph-traversals---bfs--dfs/
[contentSize] => 101913 B
[width] => 1880
[height] => 1253
[cDNContentUrl] => https://th.bing.com/th/id/R.cf2f7c5648760af501f59d0fe6bf98b9?rik=hd%2fDYbffop8ZMw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 22A091D6DF05E525E7F633199FA2DFB761C3DF85
[accentColor] => AA2133
)
[94BC8E30D8D56AA34360B0795796949CCE53C304] => Array
(
[name] => DFS vs. BFS: A Student’s Guide to Graph Traversal Algorithms
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.2QiW9mDU-EX7dgEozsDR5wHaB2?pid=Api
[datePublished] => 2025-11-28T06:53:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.lingayasvidyapeeth.edu.in/sanmax/wp-content/uploads/2026/02/Admission-open-Website-Page-Graphics-1100x275-Pixel.webp
[hostPageUrl] => https://www.lingayasvidyapeeth.edu.in/dfs-vs-bfs-a-students/
[contentSize] => 57952 B
[width] => 1100
[height] => 275
[cDNContentUrl] => https://th.bing.com/th/id/R.d90896f660d4f845fb760128cec0d1e7?rik=ScvoA41dpjo0Bg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 403C35ECC9496975970B06343AA65D8D03E8CB49
[accentColor] => B65C15
)
[BAFA1E22CF558159ADB74B4783AC4002AD24C717] => Array
(
[name] => AI Algorithms - Notes on BFS, DFS, TSP, and More (CS101) - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.sS9HDbUrvF47JRGlCDGxZQHaJl?pid=Api
[datePublished] => 2025-09-12T02:20:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/7b45080acf4711c8d96f77cc379b2201/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/kuppam-engineering-college/electronics-and-communication-engineering/ai-algorithms-notes-on-bfs-dfs-tsp-and-more-cs101/137984778
[contentSize] => 153330 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.b12f470db52bbc5e3b2511a50831b165?rik=q6%2fhIvxVGJXaew&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 717C42DA2004CA3874B47BDA951855FC22E1AFAB
[accentColor] => 666666
)
[E71499A7858DB671A7B5B4E8CDDC4B00DB2CDB2B] => Array
(
[name] => important Data structures and Algorithm Concepts | Talent Battle
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.WktDRp05JtId8ukG2XkDFAAAAA?pid=Api
[datePublished] => 2022-11-04T21:08:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://talentbattle.in/Files/C4U_Images/C4U_CKEDITOR_IMAGES/IMG10382_BFSDFS1.PNG
[hostPageUrl] => https://talentbattle.in/technical-interview-questions-and-concepts/data-structures-and-algorithm-concepts
[contentSize] => 86038 B
[width] => 370
[height] => 372
[cDNContentUrl] => https://th.bing.com/th/id/R.5a4b43469d3926d21df2e906d9790314?rik=fkGZeljYaxd6Ww&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B2BDC2BD00B4CDDC8E4B5B7A176BD8587A99417E
[accentColor] => 1498B7
)
[412F0761528CAC32AA3BB20F4B0C97363F17E62C] => Array
(
[name] => Graph Algorithms: DFS & BFS Techniques - CS101 Lecture Notes - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.__HSF0NlLwmuPYukGWCY6gHaKe?pid=Api
[datePublished] => 2025-05-30T15:37:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/bf5ea4c12cdead78c13b5ee92c71aeec/thumb_1200_1697.png
[hostPageUrl] => https://www.studocu.com/in/document/psg-college-of-technology/dbms/graph-algorithms-dfs-bfs-techniques-cs101-lecture-notes/128790448
[contentSize] => 372337 B
[width] => 1200
[height] => 1697
[cDNContentUrl] => https://th.bing.com/th/id/R.fff1d21743652f09ae3d8ba4196098ea?rik=FPJwFiXIyiOqsw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C26E71F36379C0B4F02BB3AA23CAC8251670F214
[accentColor] => 775E50
)
[2D325020CB53CC2B1729258720B4AB9BA77C159C] => Array
(
[name] => Exp No. 1: Implementation of Uninformed Search Algorithms (BFS, DFS ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.Gk6erdvt7HBBAB9xyImNMgHaKd?pid=Api
[datePublished] => 2025-10-16T02:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/42b116861eff9cd522734461adcab027/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/st-xaviers-catholic-college-of-engineering/big-data-analytics/exp-no-1-implementation-of-uninformed-search-algorithms-bfs-dfs/142142231
[contentSize] => 83539 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.1a4e9eaddbedec7041001f71c8898d32?rik=0iMFArw1zLJxkg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C951C77AB9BA4B0278529271B2CC35BC020523D2
[accentColor] => 4C4C4C
)
[6A443FD4AA2803A1C0D51D722411B782D3D627F7] => Array
(
[name] => Striver Graph Algorithms Notes (CS101) - BFS, DFS, MST, Cycle Detection ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.YpnI1HJRQNvpN45nq9_7ugHaKd?pid=Api
[datePublished] => 2025-07-06T01:43:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/d8a0548f5bb08aeb0976f408e8d92dff/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/indian-institute-of-technology-madras/data-structures-and-algorithms-graphs/striver-graph-algorithms-notes-cs101-bfs-dfs-mst-cycle-detection/124574492
[contentSize] => 579976 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.6299c8d4725140dbe9378e67abdffbba?rik=pkTzTaqCMBoMXQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7F726D3D287B114227D15D0C1A3082AA4DF344A6
[accentColor] => 4C4770
)
[0FA0AE1BB15A5CE42400CBB23CF64443CE4F7B57] => Array
(
[name] => Python Programming Notes - PYTHON PROGRAMMING [R17A0554] LECTURE NOTES ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.JOfrhAgY_XX1OnId8HXNOgAAAA?pid=Api
[datePublished] => 2023-06-08T20:38:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/7b2ea3212e1bb944c8fa46eb01e7b2e8/thumb_300_388.png
[hostPageUrl] => https://www.studocu.com/in/document/meenakshi-sundararajan-engineering-college/problem-solving-and-python-programming/python-programming-notes/54261550
[contentSize] => 28186 B
[width] => 300
[height] => 388
[cDNContentUrl] => https://th.bing.com/th/id/R.24e7eb840818fd75f53a721df075cd3a?rik=8ArqsRulxU5CAA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 75B7F4EC34446FC32BBC00424EC5A51BB1EA0AF0
[accentColor] => 4B5455
)
[637DDD02209765206CD558EA34DB5F2395561070] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.2uzjqFca7KnMaZUvDR2psAHaET?pid=Api
[datePublished] => 2021-03-23T15:44:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/bfs/images/bfs_steps.png
[hostPageUrl] => https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/bfs/bfs-algorithm.html
[contentSize] => 298982 B
[width] => 2367
[height] => 1377
[cDNContentUrl] => https://th.bing.com/th/id/R.daece3a8571aeca9cc69952f0d1da9b0?rik=NtfdIAJ5VgLGXQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0701655932F5BD43AE855DC60256790220DDD736
[accentColor] => 71A02B
)
[586D85244B6344C0F1AFECDB428A55BB4B29DB99] => Array
(
[name] => AI & ML Lab Notes: Implementation of Search Algorithms & Models (CS3491 ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.JceNdGrfLhMMlxGD72r-nAHaKd?pid=Api
[datePublished] => 2024-12-13T01:41:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/d68ae5badbc4034b77df073e3528cee3/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/anna-university/artificial-intelligence-and-data-science/aiml-manual-new-copy-lab-notes/113654552
[contentSize] => 152347 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.25c78d746adf2e130c971183ef6afe9c?rik=hdZYQrQ2RAwf%2bg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 99BD92B4BB55A824BDCEFA1F0C4436B44258D685
[accentColor] => 424242
)
[627939F823651292D7AA940BABBEFAA0C388D005] => Array
(
[name] => AI Codes 2: BFS, DFS, A* & Minimax Algorithms - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.jOjqqJOYOONyTco_RIfCGgHaKd?pid=Api
[datePublished] => 2025-10-07T03:16:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/fce6b8a97877d133182b052014f1cd30/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/vellore-institute-of-technology/artificial-intelligence/ai-codes-2-bfs-dfs-a-minimax-algorithms/140875992
[contentSize] => 53222 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.8ce8eaa8939838e3724dca3f4487c21a?rik=JpeTjzJWISl9qg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 500D883C0AAFEBBAB049AA7D292156328F939726
[accentColor] => 4F4F4F
)
[BFD6812C5DDB0AF47DCE4DF8BA563F55B26B2E63] => Array
(
[name] => GPS Application Algorithms: BFS & DFS for Route Finding - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.YpsnSCLfjam5pk39IBc5kQHaKd?pid=Api
[datePublished] => 2025-05-10T06:24:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/8b39172f697cc50b166433dca7a8e017/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/srm-institute-of-science-and-technology/artificial-intelligence/gps-application-algorithms-bfs-dfs-for-route-finding/126493884
[contentSize] => 394899 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.629b274822df8da9b9a64dfd20173991?rik=%2b20YwtW9oE%2fX7A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 36E2B62B55F365AB8FD4ECD74FA0BDD5C2186DFB
[accentColor] => 2E729D
)
[342A27B44F1875EEF9CB9ED70A8E0D4532C9F890] => Array
(
[name] => Depth First Search (DFS) Algorithm - Scaler Topics
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.7GuyTLoJbjMix6Z1XP7l8wHaEe?pid=Api
[datePublished] => 2024-11-11T03:27:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://scaler.com/topics/images/DFS-example
[hostPageUrl] => https://www.saludolearning.in/topics/data-structures/depth-first-search-dfs-algorithm/index.html
[contentSize] => 48980 B
[width] => 1701
[height] => 1028
[cDNContentUrl] => https://th.bing.com/th/id/R.ec6bb24cba096e3322c7a6755cfee5f3?rik=Q6JyS%2fSBV%2b6fvA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 098F9C2354D0E8A07DE9BC9FEE5781F44B72A243
[accentColor] => 016ECA
)
[7A9024C481246A2CB7F54EF52696E0F10C3AEF9F] => Array
(
[name] => BFS Algorithm and DFS algorithm Assignment - Data Analysis - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.cQ2R1JjzdIJ3ftCxTxFd1gAAAA?pid=Api
[datePublished] => 2022-02-07T22:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://lh3.googleusercontent.com/a-/AFdZucrpJNo85dxDnGGYimJAixMSPBbDNZuX7EqWcrkN=s96-c
[hostPageUrl] => https://www.studocu.com/in/document/amity-university/data-analysis/bfs-algorithm-and-dfs-algorithm-assignment/19465350
[contentSize] => 3588 B
[width] => 96
[height] => 96
[cDNContentUrl] => https://th.bing.com/th/id/R.710d91d498f37482777ed0b14f115dd6?rik=pwlCTBhCpsJ7Xw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F9FEA3C01F0E69625FE45F7BC2A642184C4209A7
[accentColor] => 03B8C8
)
[B86132DC78753B57247F750702F0F553F0D54735] => Array
(
[name] => AI Practical - Depth First Search Algorithm # DFS algorithm def dfs ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Nz-FXvNg0JiZgGMkICSPYAAAAA?pid=Api
[datePublished] => 2024-05-05T08:55:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/4f325a0df3799e48a501e1a680e4bccd/thumb_300_424.png
[hostPageUrl] => https://www.studocu.com/in/document/dr-babasaheb-ambedkar-technological-university/artificial-intelligence/ai-practical/89243059
[contentSize] => 12115 B
[width] => 300
[height] => 424
[cDNContentUrl] => https://th.bing.com/th/id/R.373f855ef360d0989980632420248f60?rik=ixYjzYdXs3VC9w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 53745D0F355F0F207057F74275B35787CD23168B
[accentColor] => 464646
)
[912111C740ABBC03D4D063F1E3B880F820728039] => Array
(
[name] => Graph Representation - Data Structures Tutorial | Study Glance
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.f1X4pd5y5ryhnLeBNJT3UwHaFh?pid=Api
[datePublished] => 2023-12-11T18:29:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://studyglance.in/ds/images/Adjacency-List.jpg
[hostPageUrl] => https://studyglance.in/ds/display.php?tno=33&topic=Breadth-First-Search
[contentSize] => 274296 B
[width] => 1343
[height] => 1001
[cDNContentUrl] => https://th.bing.com/th/id/R.7f55f8a5de72e6bca19cb7813494f753?rik=GRIRfAS6yzBNDQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 930827028F088B3E1F360D4D30CBBA047C111219
[accentColor] => 0A2B6A
)
[6C954090B76498602E48AFFD910F9D19BB451564] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.07I8vWyULnKjti8wZ5HjIAHaF4?pid=Api
[datePublished] => 2021-03-23T15:44:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/analysis/images/bfs.png
[hostPageUrl] => https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/analysis/comparison-with-other-algorithms.html
[contentSize] => 188129 B
[width] => 633
[height] => 503
[cDNContentUrl] => https://th.bing.com/th/id/R.d3b23cbd6c942e72a3b62f306791e320?rik=xlkECXtGiQbihA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 465154BB91D9F019DFFA84E20689467B090459C6
[accentColor] => 596772
)
[0B5CE73FC6BFE272915E46448058BA9964904C98] => Array
(
[name] => AI&ML LAB - Algorithms Implementation: BFS, DFS, Naïve Bayes and ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP._K4IVJ0kodWCjv3yTlu7bwHaKd?pid=Api
[datePublished] => 2024-11-22T09:34:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/6873ee7a0b2e9d34356eb0aff608f536/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/anna-university/aiml/aiml-lab-lab/108246114
[contentSize] => 162664 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.fcae08549d24a1d5828efdf24e5bbb6f?rik=sMV%2b82z7LicZ5Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 89C4094699AB85084464E519272EFB6CF37EC5B0
[accentColor] => 434343
)
[AED825D633CE5AB4AAA6741450BB843CAF1AFC67] => Array
(
[name] => 12 Computer Science-Datastructure-Notes - CLASS-XII COMPUTER SCIENCE ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.LV0ia9Q7kCKWmO2pSZzb-gHaKd?pid=Api
[datePublished] => 2023-05-30T14:09:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/15642ed5f230e1b709a2a7b7f36a854c/thumb_1200_1696.webp
[hostPageUrl] => https://www.studocu.com/in/document/seshadripuram-college/bachelors-of-computer-applications/12-computer-science-datastructure-notes/38890578
[contentSize] => 89792 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.2d5d226bd43b90229698eda9499cdbfa?rik=6o1SbTPspUuqag&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 76CFA1FAC348BB0541476AAA4BA5EC336D528DEA
[accentColor] => 666566
)
[0CF42C48FA6547C85596C4A4B7CE402A12AF8595] => Array
(
[name] => Practical No 1-3: Implementing DFS & BFS Algorithms for Graph Traversal ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.P5piMMFYF5P1JSrNHvyoZgHaKd?pid=Api
[datePublished] => 2025-02-17T14:36:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/d800df26ea4b383601c9228045f44839/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/practical-no1-3/118337575
[contentSize] => 435430 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.3f9a6230c1581793f5252acd1efca866?rik=wE%2fChK9WdIxVaQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5958FA21A204EC7B4A4C69558C7456AF84C24FC0
[accentColor] => 620AC1
)
[1C312D4F9BA515D30B0BF33FCFBE050EA93B6534] => Array
(
[name] => Graph Traversal Algorithms BFS and DFS - MODULE 3: GRAPH AND TREE ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.XEGsZCCFPqUSR57-81MQBQAAAA?pid=Api
[datePublished] => 2024-01-26T09:12:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/6ec1ad7400b4fb8a2972f0d69559dfb8/thumb_300_388.png
[hostPageUrl] => https://www.studocu.com/in/document/sardar-vallabhbhai-patel-university-of-agriculture-and-technology/techniques-in-biochemistry/graph-traversal-algorithms-bfs-and-dfs/78800524
[contentSize] => 34428 B
[width] => 300
[height] => 388
[cDNContentUrl] => https://th.bing.com/th/id/R.5c41ac6420853ea512479efef3531005?rik=wRPS9LlaUT2wsA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4356B39AE050EBFCF33FB0B03D515AB9F4D213C1
[accentColor] => 222222
)
[99E7E1BCF8D7515972823F699D7A3830E040FC75] => Array
(
[name] => CS 3491 Laboratory Manual: Implementing Search Algorithms (BFS & DFS ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.4UZpy-UrGDmKBNHEJSdXLwHaEK?pid=Api
[datePublished] => 2025-12-15T04:54:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/d3464055259dc214d057ee7dfbc57994/thumb_784_441.png
[hostPageUrl] => https://www.studocu.com/in/document/anna-university/artificial-intelligence-and-data-science/cs-3491-laboratory-manual-implementing-search-algorithms-bfs-dfs/148888888
[contentSize] => 10991 B
[width] => 784
[height] => 441
[cDNContentUrl] => https://th.bing.com/th/id/R.e14669cbe52b18398a04d1c42527572f?rik=mX4ey499FZUnKA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 57CF040E0383A7D996F3282795157D8FCB1E7E99
[accentColor] => 494949
)
[5D16A00C9432AE11435D59D326AEFCFE5B735CA7] => Array
(
[name] => In the following graphs, assume that if there is ever a choice amongst ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.bgY8cbDtTjMOPed_fd2UoQHaB5?pid=Api
[datePublished] => 2023-09-02T11:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/dc2/b69c950b4a28329e312f43f488b5def1.png
[hostPageUrl] => https://brainly.in/question/57828396
[contentSize] => 14729 B
[width] => 622
[height] => 160
[cDNContentUrl] => https://th.bing.com/th/id/R.6e063c71b0ed4e330e3de77f7ddd94a1?rik=1WEKwEkj6hE01Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7AC537B5EFCFEA623D95D53411EA2349C00A61D5
[accentColor] => 765568
)
[BF04B222301E518D347D236F79BE0813316DCCC9] => Array
(
[name] => What is the difference between depth first and breadth first search in ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.ZX27loXSODUwHPIRYqQZ4wHaKe?pid=Api
[datePublished] => 2019-01-08T20:12:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/db8/f32b9d81a794a8ffaa63fd80c0f2604e.jpg
[hostPageUrl] => https://brainly.in/question/6454403
[contentSize] => 594536 B
[width] => 2125
[height] => 3005
[cDNContentUrl] => https://th.bing.com/th/id/R.657dbb9685d23835301cf21162a419e3?rik=%2b0ArIgPhFdhD1w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9CCCD6133180EB97F632D743D815E103222B40FB
[accentColor] => 1E60AD
)
[33F9F144E380412AE9CE75B2EE014939CAA3CD17] => Array
(
[name] => AI Lab Manual (310253): Exploring DFS, BFS, A*, and Prim’s Algorithms ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.ipMooSCPsJZ2KbQ5ofr2NgHaJl?pid=Api
[datePublished] => 2025-02-14T08:14:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/6798980f2c82b9cee977b899e731d71d/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/ai-lab-manual/118002610
[contentSize] => 284425 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.8a9328a1208fb0967629b439a1faf636?rik=M58fRD4IFKKe7A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 71DC3AAC939410EE2B57EC9EA214083E441F9F33
[accentColor] => 837A48
)
[8BD4A53200FB0EDE6F3118413ADEC1AE8C11CCD4] => Array
(
[name] => Exp-1: Depth First Search & Breadth First Search Algorithms - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.MApV06Ez7sxAtUOJffllMAHaKd?pid=Api
[datePublished] => 2025-10-05T09:14:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/6915e81121e560bff9491a472390205e/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/artificial-intelligence-and-data-science/exp-1-depth-first-search-breadth-first-search-algorithms/140757175
[contentSize] => 198416 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.300a55d3a133eecc40b543897df96530?rik=uE1aIwC%2f4O32Ew&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4DCC11C8EA1CEDA3148113F6EDE0BF00235A4DB8
[accentColor] => 4D4D4D
)
[884CB9E9151045E4BB0D09DBA30BE3E1BA1C8B1D] => Array
(
[name] => Depth-first and breadth-first search in Haskell
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.O0Ece5lWJWt1AKpuuGG3gAAAAA?pid=Api
[datePublished] => 2021-04-19T02:29:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://malv.in/images/xkcd-2407-depth_and_breadth.png
[hostPageUrl] => https://malv.in/posts/2021-01-09-depth-first-and-breadth-first-search-in-haskell.html
[contentSize] => 79514 B
[width] => 350
[height] => 449
[cDNContentUrl] => https://th.bing.com/th/id/R.3b411c7b9956256b7500aa6eb861b780?rik=iMSbnlEBVE670A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D1B8C1AB1E3EB03ABD90D0BB4E5401519E9BC488
[accentColor] => 363636
)
[0AA3B6D0FDD2BAF0AD6EDB18B3705597DCECA63F] => Array
(
[name] => EXP4 - Roll No:- LAB MANUAL Experiment No. 4 :Uninformed Search- BFS ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.beDpn-Gdl1DxAPxbx0HVjwHaJl?pid=Api
[datePublished] => 2024-03-27T20:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/231ac6ebe87285490a6ba5a40f436385/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-mumbai/computer-engineering/exp4/86909938
[contentSize] => 150992 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.6de0e99fe19d9750f100fc5bc741d58f?rik=oDprDd8tqw%2fa5g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F36ACECD7955073B81BDE6DA0FAB2DDF0D6B3AA0
[accentColor] => 434343
)
[D86F6A4C9DA06641FFD871BA4EF53E2BF45C9DE9] => Array
(
[name] => DFS and BFS implemnet - EXPERMENT NO: 4 NAME OF THE EXPERMENT: BFS ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.1L8kKDipio3ZfbdcUqlMxwHaJl?pid=Api
[datePublished] => 2023-03-03T11:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a001a774bb8c92700dc65cdb36e787f3/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/gujarat-technological-university/analysis-and-design-of-algorithms/dfs-and-bfs-implemnet/47442183
[contentSize] => 220806 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.d4bf242838a98a8dd97db75c52a94cc7?rik=jfamxNkKZhT%2fjQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9ED9C54FB2E35FE4AB178DFF14660AD9C4A6F68D
[accentColor] => C06B0B
)
[EDEE004830C639D97F592EEE022D4710ED3693A2] => Array
(
[name] => DFS Algorithm Implementation - LAB - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.FPyZoe2qg101jr32ayH2HQHaKd?pid=Api
[datePublished] => 2026-02-17T21:42:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/d3d1162bfe6fd9460ae25d1dcdcad9d3/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/manonmaniam-sundaranar-university/data-structure/dfs-algorithm-implementation-lab/153627441
[contentSize] => 128737 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.14fc99a1edaa835d358ebdf66b21f61d?rik=3u4AhANsk533lQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2A3963DE0174D220EEE295F79D936C038400EEDE
[accentColor] => 444444
)
[65A433B2134483B5EE8963C66C22D315B5AA59D3] => Array
(
[name] => AI Module 1 - Search Algorithms - MODULE 1 - SEARCH ALGORITHMS (BFS,DFS ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.lP4INc-BjgRRpFIG7JWy-wHaFu?pid=Api
[datePublished] => 2023-04-02T12:53:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/d040ecf60338ee5a5fc6281baeecdd70/thumb_1200_927.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-calicut/b-tech/ai-module-1-search-algorithms/49925622
[contentSize] => 81354 B
[width] => 1200
[height] => 927
[cDNContentUrl] => https://th.bing.com/th/id/R.94fe0835cf818e0451a45206ec95b2fb?rik=VkozKzFEOFvumA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3D95AA5B513D22C66C3698EE5B3844312B334A56
[accentColor] => 363636
)
[89392B8964D978C78D18ED7E81C64078A634D1D3] => Array
(
[name] => Kosaraju using DFS - Algorithms - Computer Science Engineering (CSE ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.K_YXoYbDZUrBtVlxEqc1hAAAAA?pid=Api
[datePublished] => 2021-06-06T02:54:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://cn.edurev.in/ApplicationImages/ContentImages/7176ac8c-a1e4-44b5-ba38-27c171ef7aa1_icon.jpg
[hostPageUrl] => https://edurev.in/t/187394/Kosaraju-using-DFS
[contentSize] => 4213 B
[width] => 250
[height] => 143
[cDNContentUrl] => https://th.bing.com/th/id/R.2bf617a186c3654ac1b5597112a73584?rik=mJOymEadh3zYgQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3D1D436A87046C18E7DE81D87C879D4698B29398
[accentColor] => 3E8D54
)
[87B72061A301CFF820DFBD5CD8C3532417F2D789] => Array
(
[name] => Differentiate between DFS and BFS.
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.m5E22nQi5h3Atmf1aLcM9QHaCI?pid=Api
[datePublished] => 2022-12-25T15:04:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://vedveethi.co.in/eNote/DataStru/eNotes-DS-CS302-U5_files/image016.jpg
[hostPageUrl] => https://vedveethi.co.in/eNote/DataStru/eNotes-DS-CS302-U5.htm
[contentSize] => 4807 B
[width] => 486
[height] => 140
[cDNContentUrl] => https://th.bing.com/th/id/R.9b9136da7422e61dc0b667f568b70cf5?rik=eHsCFjoQ%2fI8C%2fQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 987D2F7142353C8DC5DBFD028FFC103A16027B78
[accentColor] => 666666
)
[F060843840796F3F8D6E0D2E997AE36ADC64EDD4] => Array
(
[name] => Python - Depth First Search Code Recursive
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.pXLLra0A8M60A3yKARfZ7QHaCC?pid=Api
[datePublished] => 2023-08-06T18:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Images/Python-Depth-First-Search-Code-Recursive10.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Python-Depth-First-Search-Code-Recursive.htm
[contentSize] => 11610 B
[width] => 706
[height] => 194
[cDNContentUrl] => https://th.bing.com/th/id/R.a572cbadad00f0ceb4037c8a0117d9ed?rik=DwZIgwSX9vPY5g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4DDE46CDA63EA799E2D0E6D8F3F697048348060F
[accentColor] => 009242
)
[A45664C42681C86D6B46774B39A0586386923A7F] => Array
(
[name] => ALGORITHMS
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.RtLqSxNtCr-jdNtkrpAylgHaHa?pid=Api
[datePublished] => 2020-08-03T15:38:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/logo.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Algorithm.htm
[contentSize] => 123040 B
[width] => 500
[height] => 500
[cDNContentUrl] => https://th.bing.com/th/id/R.46d2ea4b136d0abfa374db64ae903296?rik=SmVGTGIYjNa2ZA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F7A3296836850A93B47764B6D68C18624C46654A
[accentColor] => C49E07
)
[6525E43D38A9CAACB8870D2E997AE36ADC64EDD4] => Array
(
[name] => Python - Depth First Search Code Recursive
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.qBN4mRjacvjQoVUdJ6jxFQAAAA?pid=Api
[datePublished] => 2023-08-06T18:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Images/Python-Depth-First-Search-Code-Recursive11.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Python-Depth-First-Search-Code-Recursive.htm
[contentSize] => 3195 B
[width] => 140
[height] => 450
[cDNContentUrl] => https://th.bing.com/th/id/R.a813789918da72f8d0a1551d27a8f115?rik=VlJO04OarMqLeA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4DDE46CDA63EA799E2D0788BCAAC9A83D34E5256
[accentColor] => CC3200
)
[729F8D1CD2017B45384456EADDFEAC5D0BF027FA] => Array
(
[name] => Breadth-First Search - Graph Algorithm
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.eyc_Kp1fkZlD-hnSLvbTTwHaEo?pid=Api
[datePublished] => 2024-01-06T21:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://learn.innoskrit.in/content/images/size/w1000/2024/01/BFS.gif
[hostPageUrl] => https://learn.innoskrit.in/graph/breadth-first-search/
[contentSize] => 392761 B
[width] => 1536
[height] => 960
[proxyContentUrl] => https://tse4.mm.bing.net/th/id/OGC.7b273f2a9d5f919943fa19d22ef6d34f?pid=Api&rurl=https%3a%2f%2flearn.innoskrit.in%2fcontent%2fimages%2fsize%2fw1000%2f2024%2f01%2fBFS.gif&ehk=yrs9ugA3i1TrEZsaiKAAIwTzOCl04ZfPEl6TZ2%2foB6Y%3d
[cDNContentUrl] => https://th.bing.com/th/id/R.7b273f2a9d5f919943fa19d22ef6d34f?rik=J%2fnYwS0Qt1SDRA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AF720FB0D5CAEFDDAE65448354B7102DC1D8F927
[accentColor] => C9A502
)
[CCB3698FB78FBFA89445A3B19AAAACF5060BF920] => Array
(
[name] => Python - Breadth First Search Code
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.Q-Uk31N2mxie_1qtpsuMFQAAAA?pid=Api
[datePublished] => 2023-08-06T18:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Images/Python-Breadth-First-Search-Code8.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Python-Breadth-First-Search-Code.htm
[contentSize] => 25489 B
[width] => 405
[height] => 364
[cDNContentUrl] => https://th.bing.com/th/id/R.43e524df53769b189eff5aada6cb8c15?rik=zDuW%2bHv4%2b4pJVA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 029FB0605FCAAAA91B3A54498AFBF87BF8963BCC
[accentColor] => C08C0B
)
[553505430875912373D2BA406505986A65D295EC] => Array
(
[name] => DFS (Depth First Search) algorithm - It is a recursive algorithm to ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.kRCpOIUlrUarU0eeDCiDhwHaKe?pid=Api
[datePublished] => 2022-12-31T04:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/d7eda2c423b72b014640fdf5932e4729/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/bharati-vidyapeeth-university/algorithms-and-data-structures/dfs-depth-first-search-algorithm/42781113
[contentSize] => 354399 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.9110a9388525ad46ab53479e0c288387?rik=VVNQNIBXGTI3LQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => CE592D56A689505604AB2D373219578034505355
[accentColor] => 6A1A44
)
[A2FF398B697747A76ED247B9569FD8FA2C4F2671] => Array
(
[name] => Best Data Structure Courses in Dharamshala & Hamirpur, Himachal Pradesh ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.oUdcep9xz-N92uQjOCuRTAHaIE?pid=Api
[datePublished] => 2024-09-29T17:24:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.netcoder.in/images/Data-Structures.png
[hostPageUrl] => https://www.netcoder.in/data-structures.html
[contentSize] => 51753 B
[width] => 1684
[height] => 1835
[cDNContentUrl] => https://th.bing.com/th/id/R.a1475c7a9f71cfe37ddae423382b914c?rik=Kv%2bTuJZ3dHrmLQ&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 1762F4C2AF8DF9659B742DE67A747796B893FF2A
[accentColor] => C74504
)
[753D2482EDB63F1EAAC97A8D223097F618DC436A] => Array
(
[name] => Algorithms: introduction to algorithms Thomas H.cormen q.22.2-3
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.5o8J6mL1OUaPb2qQvC4nIAHaEb?pid=Api
[datePublished] => 2017-10-19T13:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=17871884588635617206
[hostPageUrl] => https://gateoverflow.in/82109/introduction-to-algorithms-thomas-h-cormen-q-22-2-3
[contentSize] => 25592 B
[width] => 600
[height] => 359
[cDNContentUrl] => https://th.bing.com/th/id/R.e68f09ea62f539468f6f6a90bc2e2720?rik=V9NCKN5r8%2bGqnA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A634CD816F790322D8A79CAAE1F36BDE2842D357
[accentColor] => 70695B
)
[680A4473DACF11F34BF752EC3B19020268A44C1A] => Array
(
[name] => AI Lab 8: Implementing the Monkey Banana Problem in Python - Studocu
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.9suvbPR4D1-4X1wcZVnBtQHaJl?pid=Api
[datePublished] => 2025-05-28T06:15:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/50e936e7115f1b794b6912dcc6470edf/thumb_1200_1553.webp
[hostPageUrl] => https://www.studocu.com/in/document/siddhartha-institute-of-engineering-technology/computer-science-and-engineering/ai-lab-8-implementing-the-monkey-banana-problem-in-python/127802863
[contentSize] => 80776 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.f6cbaf6cf4780f5fb85f5c1c6559c1b5?rik=hqBEN638ET%2b0fw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A1C44A86202091B3CE257FB43F11FCAD3744A086
[accentColor] => 856246
)
[37B125A38F259CA089025AE057FCBB85ADA250D3] => Array
(
[name] => Breadth First Search - Bfs structure - Breadth First Search The only ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.UzmdLGbiUaE7SODg9uQqnAHaJl?pid=Api
[datePublished] => 2023-06-13T03:16:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/476ffa13865835370423d560050c4765/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-calicut/artificial-intelligence/breadth-first-search-bfs-structure/46009211
[contentSize] => 297282 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.53399d2c66e251a13b48e0e0f6e42a9c?rik=cxtSOvhSyQqYIA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3D052ADA58BBCF750EA520980AC952F83A521B73
[accentColor] => 078D07
)
[72138260F6A7934B53B8E898C0FDD19132E7CB9B] => Array
(
[name] => DFS Program in C Explained
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.EQMbK-ILodsv3TDOr1a3xQHaD5?pid=Api
[datePublished] => 2025-01-08T08:19:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/dfs-program-in-c-explained-images-4.png
[hostPageUrl] => https://www.ccbp.in/blog/articles/dfs-program-in-c
[contentSize] => 17799 B
[width] => 716
[height] => 377
[cDNContentUrl] => https://th.bing.com/th/id/R.11031b2be20ba1db2fdd30ceaf56b7c5?rik=JzEoBm96ObQ1iw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B9BC7E23191DDF0C898E8B35B4397A6F06283127
[accentColor] => CB6400
)
[7A170EBEAEEE0BD60DE5C04A7D3A73B8D900CC20] => Array
(
[name] => Searching Strategies : Breadth First Search
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.fuKtzbeBLqPiHYVWAo0j2gHaKe?pid=Api
[datePublished] => 2020-12-12T18:13:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://minigranth.in/images/tutorials/AI%20IMAGES/BFS.jpg
[hostPageUrl] => https://minigranth.in/artificial-intelligence-tutorial/searching-strategies-in-ai
[contentSize] => 179039 B
[width] => 1240
[height] => 1754
[cDNContentUrl] => https://th.bing.com/th/id/R.7ee2adcdb7812ea3e21d8556028d23da?rik=p3Hg6%2brusG3QXg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 02CC009D8B37A3D7A40C5ED06DB0EEEAEBE071A7
[accentColor] => 434343
)
[5C8F659BBE12D7270C79E78953024F52AA6E632D] => Array
(
[name] => Difference between BFS and DFS BFS vs. DFS - Free Feast - 4/5/2017 ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.VqyQ8WZINA2mXyovaodKggHaJl?pid=Api
[datePublished] => 2021-09-18T17:23:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/c318f6b3ca2128f1f575191b3a0e9b5b/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/lovely-professional-university/data-structures/difference-between-bfs-and-dfs-bfs-vs-dfs-free-feast/5730029
[contentSize] => 485532 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.56ac90f16648340da65f2a2f6a874a82?rik=xfhWueshfXLAlw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D236E6AA25F42035987E97C0727D21EBB956F8C5
[accentColor] => 763C09
)
[99D20B0A9F9B701AAF8E806EF93712073E36E1F4] => Array
(
[name] => Mechanics VIVA- Question - Artificial Intelligence - ENGINEERING ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.7JQlhywmVc5iitRW-_OKmAAAAA?pid=Api
[datePublished] => 2023-03-20T04:13:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/21ef8ea0b3a61c1ef1a505d5a5ac74e9/thumb_300_424.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/mechanics-viva-question/39100304
[contentSize] => 56235 B
[width] => 300
[height] => 424
[cDNContentUrl] => https://th.bing.com/th/id/R.ec9425872c2655ce628ad456fbf38a98?rik=mS2woPm5B6H66A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4F1E63E37021739FE608E8FAA107B9F9A0B02D99
[accentColor] => 505357
)
[BD7F63809C4AEB33E9BA750702F0F553F0D54735] => Array
(
[name] => AI Practical - Depth First Search Algorithm # DFS algorithm def dfs ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.7_E4ozYvQ4V3vNQa2KBwOQHaJl?pid=Api
[datePublished] => 2024-05-05T08:55:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/41634bbb60c6ead7ee83f5d2f0d56be5/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/dr-babasaheb-ambedkar-technological-university/artificial-intelligence/ai-practical/89243059
[contentSize] => 130962 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.eff138a3362f438577bcd41ad8a07039?rik=2%2fc2CMmkvjOeqw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 53745D0F355F0F207057AB9E33BEA4C90836F7DB
[accentColor] => 9B6030
)
[ECA55A956096A5ACC71C0959E76A1DABE937BA82] => Array
(
[name] => i-GATE Learning APP Online Examination Platform
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.n9Vj2P3eK5YGphqc_Re-IQAAAA?pid=Api
[datePublished] => 2024-08-30T23:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d3uz5ylpe6gfxz.cloudfront.net/institute/igate/chapter_contents/700b8c21759f46f4ab357aae30a60a59.jpeg
[hostPageUrl] => http://igate.testpress.in/products/gate-cs-campus-recruitment-course-c-programming-data-structure-and-algorithm/
[contentSize] => 27781 B
[width] => 320
[height] => 180
[cDNContentUrl] => https://th.bing.com/th/id/R.9fd563d8fdde2b9606a61a9cfd17be21?rik=zlqlWQZpWsp8wQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 28AB739EBAD1A67E9590C17CCA5A690659A55ACE
[accentColor] => B9125B
)
[DCE800C0BF989D08C83F57EBA88BAD94690525C9] => Array
(
[name] => BFS Vs DFS Video Lecture - DSA in C++ - Software Development
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.nbJSMWYlxx5XIaHPvhLpVQHaFj?pid=Api
[datePublished] => 2023-05-19T02:16:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://img.youtube.com/vi/LMH1l2pR8Us/0.jpg
[hostPageUrl] => https://edurev.in/v/266825/BFS-Vs-DFS
[contentSize] => 25976 B
[width] => 480
[height] => 360
[cDNContentUrl] => https://th.bing.com/th/id/R.9db252316625c71e5721a1cfbe12e955?rik=zY4ADPuJ2YCM8w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9C52509649DAB88ABE75F38C80D989FB0C008ECD
[accentColor] => 5C0722
)
[DA8502585E116E21CCF41AF2B35A8692B9C5DBC3] => Array
(
[name] => SE-IT SEM3 DBMS MAY18 - AREGEARG - Artificial Intelligence - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.OBLfWAbSfvfYlBEx6uY_5AHaKK?pid=Api
[datePublished] => 2023-03-20T06:50:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/123e50f5a53e4a3665be0eb3dc7d4110/thumb_1200_1647.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/se-it-sem3-dbms-may18-aregearg/39099039
[contentSize] => 795530 B
[width] => 1200
[height] => 1647
[cDNContentUrl] => https://th.bing.com/th/id/R.3812df5806d27ef7d8941131eae63fe4?rik=rVggheUR5hLMTw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3CBD5C9B2968A53B2FA14FCC12E611E5852058AD
[accentColor] => 6B6060
)
[CEB7B6C7F4D12A33EBC19C9FCDDDD340382322BE] => Array
(
[name] => Algorithms Python: Explains Algorithms with Beautiful Pictures Learn it ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.2g_gkdtqgjpXjD9cF3WF9wAAAA?pid=Api
[datePublished] => 2020-09-29T08:24:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://m.media-amazon.com/images/I/41s-dxS4v2L.jpg
[hostPageUrl] => https://www.amazon.in/Algorithms-Python-Explains-Beautiful-Pictures-ebook/dp/B08CCZBNXZ
[contentSize] => 24619 B
[width] => 405
[height] => 500
[cDNContentUrl] => https://th.bing.com/th/id/R.da0fe091db6a823a578c3f5c177585f7?rik=7HtrfE8dojO%2bHA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => EB223283043DDDDCF9C91CBE33A21D4F7C6B7BEC
[accentColor] => C79804
)
[D8F25CE26C2993C1C5023BA433D9BB44D1EEEE83] => Array
(
[name] => BFS algorithm In Data Structure - BFS algorithm In this article, we ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.2RLucD5WKIplcHSYxgXU7gHaKe?pid=Api
[datePublished] => 2022-03-05T17:10:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a27d91198954806a053e885483682463/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/btech/bfs-algorithm-in-data-structure/22559861
[contentSize] => 223708 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.d912ee703e56288a65707498c605d4ee?rik=jS%2fFLsaSORxcIA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 38EEEE1D44BB9D334AB3205C1C3992C62EC52F8D
[accentColor] => 434343
)
[3BB32009FD4BFFA2BFFD9ED70A8E0D4532C9F890] => Array
(
[name] => Depth First Search (DFS) Algorithm - Scaler Topics
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.Dap7VSPUJ5RusO-SIeteagHaEK?pid=Api
[datePublished] => 2024-11-11T03:27:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://i.vimeocdn.com/video/1528425040-ea46b016c6110338e94dd196df83d406b10c3efc80313758f8c5d8a1e412c2f5-d
[hostPageUrl] => https://www.saludolearning.in/topics/data-structures/depth-first-search-dfs-algorithm/index.html
[contentSize] => 78004 B
[width] => 1920
[height] => 1080
[cDNContentUrl] => https://th.bing.com/th/id/R.0daa7b5523d427946eb0ef9221eb5e6a?rik=szsCkN%2b0%2fyr73w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 098F9C2354D0E8A07DE9DFFB2AFFB4DF90023BB3
[accentColor] => 949536
)
[DCECBE83714E045482BB556E25DC481F75B69E64] => Array
(
[name] => “A BFS-DFS Approach” Semi-Stock-Temporal Graph Traversals for Market ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.v9HBT7gryUAlTnAJOP65sQHaCf?pid=Api
[datePublished] => 2025-12-29T17:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ir.vistas.ac.in/logo.jpg
[hostPageUrl] => https://ir.vistas.ac.in/id/eprint/12159/
[contentSize] => 205533 B
[width] => 1907
[height] => 641
[cDNContentUrl] => https://th.bing.com/th/id/R.bfd1c14fb82bc940254e700938feb9b1?rik=zc7rOBfkQEUouw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 46E96B57F184CD52E655BB284540E41738EBCECD
[accentColor] => 0094CC
)
[CD44E4FF16E9EE4AA960303EF2BA4E0B1B085955] => Array
(
[name] => AI Unit 2: Search Algorithms - Random, Depth, and Heuristic Techniques ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.4RW_RZZn51Dxsu7CGeCC2wHaJl?pid=Api
[datePublished] => 2025-12-30T04:44:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/9df4d41a987bb95e79ddbc22dcb8ce58/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/thiruvalluvar-university/bcacomputer-application/ai-unit-2-search-algorithms-random-depth-and-heuristic-techniques/149869770
[contentSize] => 285095 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.e115bf459667e750f1b2eec219e082db?rik=3ERO%2f2Ge7qSaBg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 559580B1B0E4AB2FE303069AA4EE9E61FF4E44DC
[accentColor] => 00933B
)
[7ED8C82D2330CC2679DDED69AB3DE0F4B9FC8820] => Array
(
[name] => Stacks | Learn Everything about Stacks in DSA
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.uROZZrptm-9_IBTSxnT9BAHaE5?pid=Api
[datePublished] => 2023-01-23T17:10:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://talentbattle.in/Files/C4U_Images/C4U_CKEDITOR_IMAGES/IMG10951_stacks.png
[hostPageUrl] => https://talentbattle.in/learn-data-structures-and-algorithms-for-free/stacks
[contentSize] => 74140 B
[width] => 586
[height] => 387
[cDNContentUrl] => https://th.bing.com/th/id/R.b9139966ba6d9bef7f2014d2c674fd04?rik=542M0jIDzGKX3Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0288CF9B4F0ED3BA96DEDD9762CC0332D28C8DE7
[accentColor] => 60636B
)
[9324E9F8C0483C4BA3E8FC38D5D1456F166D190C] => Array
(
[name] => QUESTION 4: (5 marks) Use Breadth First Search and Depth First Search ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.HDtd2F3UivBrn2iYN7Op8QAAAA?pid=Api
[datePublished] => 2024-01-17T11:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d7b/9997940a58d30bb8661156a22d8f66af.jpg
[hostPageUrl] => https://brainly.in/question/59425908
[contentSize] => 16342 B
[width] => 428
[height] => 451
[cDNContentUrl] => https://th.bing.com/th/id/R.1c3b5dd85dd48af06b9f689837b3a9f1?rik=OUKejwyEw7Q6jg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C091D661F6541D5D83CF8E3AB4C3840C8F9E4239
[accentColor] => 263949
)
[7067B979031D8D7D8A44D9F1C7CE6AFF725FE75B] => Array
(
[name] => A.I Lab write-ups - Experiment No.: 01 Aim: - Implement the Depth First ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.dgX6RBV2MzG0BWoQ1zlhdwHaJl?pid=Api
[datePublished] => 2024-05-27T12:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/93927ce27a51fc33d0d4f756d1e6641d/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/ai-lab-write-ups/91939914
[contentSize] => 350341 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.7605fa4415763331b4056a10d7396177?rik=B3ablzDR2NeoRA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B57EF527FFA6EC7C1F9D44A8D7D8D130979B7607
[accentColor] => 610DBE
)
[373EF6D599AC27646590BF57CBD35F40CE65CA7D] => Array
(
[name] => Data Structures and Algorithms in Python : Michael T. Goodrich, Roberto ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.HdER_JF1EC0uM0FZWFuj3QHaJo?pid=Api
[datePublished] => 2017-10-18T23:46:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://m.media-amazon.com/images/I/71sMkUcfhQL._SL1000_.jpg
[hostPageUrl] => https://www.amazon.in/Structures-Algorithms-Python-Michael-Goodrich/dp/812656217X
[contentSize] => 145819 B
[width] => 769
[height] => 1000
[cDNContentUrl] => https://th.bing.com/th/id/R.1dd111fc9175102d2e334159585ba3dd?rik=c%2bNvXZnKckZWCQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D7AC56EC04F53DBC75FB09564672CA995D6FE373
[accentColor] => B74114
)
[792095225DC083E1CC653A8378C6F88B70344706] => Array
(
[name] => Mathematics n6YKk9h - aertaert - Introduction Mathematics is the ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.Kept6Y2y6l-2n9LuBUaChQHaKe?pid=Api
[datePublished] => 2023-08-28T15:29:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/1066297e790cea4b9283cc14f4cd9fad/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/mathematics-n6ykk9h-aertaert/39100299
[contentSize] => 558392 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.29ea6de98db2ea5fb69fd2ee05468285?rik=lwJZItUMOB7MVg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 60744307B88F6C8738A356CC1E380CD522590297
[accentColor] => 2B2526
)
[EDDA7A6A38F1B7DA515AC887D52617C65A83977E] => Array
(
[name] => BFS (Breadth-first search) Algorithm - Algorithms - Computer Science ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.9dtJACyOw4hb1lAijulMUQHaBv?pid=Api
[datePublished] => 2022-11-28T18:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/1611931_182afef7-b288-43ab-be50-75f013250498_lg.png
[hostPageUrl] => https://edurev.in/t/248464/BFS--Breadth-first-search--Algorithm
[contentSize] => 21874 B
[width] => 925
[height] => 218
[cDNContentUrl] => https://th.bing.com/th/id/R.f5db49002c8ec3885bd650228ee94c51?rik=3q2npoMfe60VpQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E77938A56C71625D788CA515AD7B1F83A6A7ADDE
[accentColor] => 585252
)
[642CD2772C462E243B4EB7555D89732DF7D2BF1D] => Array
(
[name] => Study Glance | Programming for Problem Solving Lab Manual(Programs)
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.5OF02X0obF8FayqnvcgSOgHaJ_?pid=Api
[datePublished] => 2025-07-15T08:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://studyglance.in/labprograms/PPS/images/compound-interest.jpeg
[hostPageUrl] => https://studyglance.in/labprograms/ppsdisplay.php?url1=PPS/simple-compound-interest-c-program.html&title=Write%20the%20program%20for%20the%20simple,%20compound%20interest
[contentSize] => 219612 B
[width] => 2083
[height] => 2809
[cDNContentUrl] => https://th.bing.com/th/id/R.e4e174d97d286c5f056b2aa7bdc8123a?rik=RsItd8Jk4kKz5A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D1FB2D7FD23798D5557BE4B342E264C2772DC246
[accentColor] => AC7D1F
)
[6B5295FF9BF3DF45F50300EEB328F6D85F5DB32F] => Array
(
[name] => Question Bank EC-II - agtragra - University of Mumbai Program: _First ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.McJA3fziJEV2ApIZI3AjGQHaKe?pid=Api
[datePublished] => 2023-03-20T06:50:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/81a616fc4530bc3c132e35c32899685f/thumb_1200_1697.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/question-bank-ec-ii-agtragra/39098971
[contentSize] => 226851 B
[width] => 1200
[height] => 1697
[cDNContentUrl] => https://th.bing.com/th/id/R.31c240ddfce224457602921923702319?rik=tiVZ%2f7k%2f%2fVRfMA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F23BD5F58D6F823BEE00305F54FD3FB9FF5925B6
[accentColor] => A32828
)
[DE6F3E328E7FE1D958DEE1A9ED7DE00B11F69D2E] => Array
(
[name] => WEEK 1- Discipline AND Ideas IN Socialsciences - NAME: - Studocu
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.GiixrV_vGENQneY28zeRQgHaLU?pid=Api
[datePublished] => 2023-03-20T06:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/ab0d06460af5ef4cc6c6c215083c0a43/thumb_1200_1835.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/week-1-discipline-and-ideas-in-socialsciences/38602451
[contentSize] => 1104965 B
[width] => 1200
[height] => 1835
[cDNContentUrl] => https://th.bing.com/th/id/R.1a28b1ad5fef1843509de636f3379142?rik=7fbjI%2bj3Hp2F7Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E2D96F11B00ED7DE9A1EED859D1EF7E823E3F6ED
[accentColor] => CCCC00
)
[4ECE54DAF98D751F60A172A9459C4BD41069721B] => Array
(
[name] => 12 IP Project - INFORMATICS PRACTICES ( 065 ) PROJECT ON – ‘’Worst ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Je-F_IXrJaC9cpGUcb5vpwHaJl?pid=Api
[datePublished] => 2023-11-03T04:54:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/2560a949b177c744b431ba5723df4234/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/12-ip-project/71126998
[contentSize] => 2481800 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.25ef85fc85eb25a0bd72919471be6fa7?rik=5OxFrZ%2fYV%2fEGGg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B12796014DB4C9549A271A06F157D89FAD45ECE4
[accentColor] => C5060A
)
[F8ADC0010A3C977D32D70D8C40E2D92C5FC8E74C] => Array
(
[name] => Algorithms: DFS Traversal
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.nvVU9IyaSXI4hxmnudaZegAAAA?pid=Api
[datePublished] => 2018-05-07T04:26:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=7159189216465345956
[hostPageUrl] => https://gateoverflow.in/193326/dfs-traversal
[contentSize] => 7168 B
[width] => 312
[height] => 160
[cDNContentUrl] => https://th.bing.com/th/id/R.9ef554f48c9a4972388719a7b9d6997a?rik=j9oMEKDDedcjfQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C47E8CF5C29D2E04C8D07D23D779C3A0100CDA8F
[accentColor] => 3D708E
)
[CF89F1E5802AECCFFF296F55AD4E9516DF94EDEC] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.iRvGKWeB8JAqnj8TSSDVIwHaDy?pid=Api
[datePublished] => 2021-03-23T15:44:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/images/undirected.png
[hostPageUrl] => https://ds1-iiith.vlabs.ac.in/exp/breadth-first-search/basics-of-graphs.html
[contentSize] => 100920 B
[width] => 1616
[height] => 826
[cDNContentUrl] => https://th.bing.com/th/id/R.891bc6296781f0902a9e3f134920d523?rik=%2fJgfXgiizvz%2fkg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => CEDE49FD6159E4DA55F692FFFCCEA2085E1F98FC
[accentColor] => 2271A9
)
[768B9BBDAB1B1A635A3B77D5C60F64AE39878EB6] => Array
(
[name] => Unit II: Search Algorithms in AI - Random, Depth, and Heuristic Methods ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.rcjsD3xZS8aj5sYGuU2IpAHaFO?pid=Api
[datePublished] => 2026-02-04T08:16:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/fe0417bf55403ee53e274217650e753a/thumb_1200_848.png
[hostPageUrl] => https://www.studocu.com/in/document/alagappa-university/artificial-intelligence/unit-ii-search-algorithms-in-ai-random-depth-and-heuristic-methods/152686514
[contentSize] => 68480 B
[width] => 1200
[height] => 848
[cDNContentUrl] => https://th.bing.com/th/id/R.adc8ec0f7c594bc6a3e6c606b94d88a4?rik=Z7i527qxoTalsw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 6BE87893EA46F06C5D77B3A536A1B1BADBB9B867
[accentColor] => 252525
)
[ACAB20C807173698C79EC887D52617C65A83977E] => Array
(
[name] => BFS (Breadth-first search) Algorithm - Algorithms - Computer Science ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.4HOcdm_bd_oTJsHRlI-3swAAAA?pid=Api
[datePublished] => 2022-11-28T18:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/1611931_3270b03b-cb1b-4402-abce-6e9e1281de36_lg.png
[hostPageUrl] => https://edurev.in/t/248464/BFS--Breadth-first-search--Algorithm
[contentSize] => 13024 B
[width] => 248
[height] => 276
[cDNContentUrl] => https://th.bing.com/th/id/R.e0739c766fdb77fa1326c1d1948fb7b3?rik=yroCjHBxY4l86Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E77938A56C71625D788CE97C896371708C02BACA
[accentColor] => 666666
)
[550ADDD071B00F10DCCF91C50A2269C283A030A7] => Array
(
[name] => Ai Practicals - Prac 1 :- Implement depth first search algorithm and ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.oFkN0e2Fochi1YniRIIf8AAAAA?pid=Api
[datePublished] => 2023-12-31T07:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/aca4922ca85d89a0aeea18ae684eff2f/thumb_300_388.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/artificial-intelligence-and-robotics/ai-practicals/77507591
[contentSize] => 39617 B
[width] => 300
[height] => 388
[cDNContentUrl] => https://th.bing.com/th/id/R.a0590dd1ed85a1c862d589e244821ff0?rik=VaDdDRcL8AHN%2fA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7A030A382C9622A05C19FCCD01F00B170DDDA055
[accentColor] => 1210BB
)
[576E3A47DBC98C432DE78E419D97F1329CC09E31] => Array
(
[name] => Modern Statistics: Intuition, Math, Python, R eBook : Cohen, Mike ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.WX3880PjlN81sy5h03LMkQHaL2?pid=Api
[datePublished] => 2025-07-07T08:34:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://m.media-amazon.com/images/I/61V2KLFTOeL._SL1000_.jpg
[hostPageUrl] => https://www.amazon.in/Modern-Statistics-Intuition-Math-Python-ebook/dp/B0CQV82FRT
[contentSize] => 71400 B
[width] => 625
[height] => 1000
[cDNContentUrl] => https://th.bing.com/th/id/R.597dfcf343e394df35b32e61d372cc91?rik=deajdL2cyDTSfg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 13E90CC9231F79D914E87ED234C89CBD74A3E675
[accentColor] => B14C1A
)
[04857C73C40420485296040676AFF83D68197C3A] => Array
(
[name] => Understanding depth-first search
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.cTL0noXTxwbieg9M17YW7AHaEC?pid=Api
[datePublished] => 2022-12-28T19:12:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d12aarmt01l54a.cloudfront.net/cms/images/Media-20221228185007/808-440.png
[hostPageUrl] => https://indiaai.gov.in/article/understanding-depth-first-search
[contentSize] => 55882 B
[width] => 808
[height] => 440
[cDNContentUrl] => https://th.bing.com/th/id/R.7132f49e85d3c706e27a0f4cd7b616ec?rik=QFjHN0xAAoQlaQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A3C79186D38FFA67604069258402404C37C75840
[accentColor] => 603218
)
[66C7E91231711AD18E43A326592DB59755391C53] => Array
(
[name] => A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.riuF7AqaLb7Wr_U4cuM23AHaDc?pid=Api
[datePublished] => 2023-01-08T10:12:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.mdpi.com/mathematics/mathematics-11-00327/article_deploy/html/images/mathematics-11-00327-g003.png
[hostPageUrl] => https://www.mdpi.com/2227-7390/11/2/327
[contentSize] => 10971 B
[width] => 2868
[height] => 1335
[cDNContentUrl] => https://th.bing.com/th/id/R.ae2b85ec0a9a2dbed6aff53872e336dc?rik=ZnyeIRMXoR3oNA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 35C19355795BD295623A34E81DA11713219E7C66
[accentColor] => CC0000
)
[1176ECC2717568770341B57E05282F77F8661726] => Array
(
[name] => Rohit - noth - Experiment No. 3 Simple Reflex Agent Vacuum Cleaner Aim ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.2S7t-Yj69g1W51bFg_c0_gHaJl?pid=Api
[datePublished] => 2024-03-22T03:44:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/b4ba953e7ddbd9c44978b8084df52a28/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/rohit-noth/86907473
[contentSize] => 202283 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.d92eedf988faf60d56e756c583f734fe?rik=EWfOLBdXhncwFA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 6271668F77F28250E75B1430778657172CCE6711
[accentColor] => 6A6661
)
[07EDCDECB14FE08FE9BD75263149CAA36C1FC613] => Array
(
[name] => MC Module 2 Question Bank - St Francis Institute of Technology TE A ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.ppmubsRXre5R8FaTJxXyTQHaJl?pid=Api
[datePublished] => 2023-11-09T11:58:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/8255fa4546d43c9a32857a8a5bec08b7/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/mc-module-2-question-bank/58176444
[contentSize] => 387526 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.a699ae6ec457adee51f056932715f24d?rik=cN7czhv0Dvie2w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 316CF1C63AAC94136257DB9EF80EF41BCEDCDE70
[accentColor] => 424452
)
[5AF461424C1B884698B77EFA8B6563F5C8B87BAA] => Array
(
[name] => Dbms Lecture Notes - Artificial Intelligence - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.JzKgPJJJvwH4WVPdgQanLgHaJl?pid=Api
[datePublished] => 2022-05-21T08:54:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/09299e87f177db83a24b78d652972547/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/dbms-lecture-notes/26510774
[contentSize] => 984861 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.2732a03c9249bf01f85953dd8106a72e?rik=pU8WJMSxiGSJew&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AAB78B8C5F3656B8AFE77B896488B1C424164FA5
[accentColor] => 3A6F91
)
[EF731C8D0A3B24059C276A609448AA1FDAD102F9] => Array
(
[name] => Depth First Search In Data Structure - Depth First Search (DFS ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.TxjuJeOJbRGBFxy2LNiTOQHaKe?pid=Api
[datePublished] => 2022-07-22T21:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/56c3b07a6efed18264bed1275bee40ea/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/btech/depth-first-search-in-data-structure/22644172
[contentSize] => 174685 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.4f18ee25e3896d1181171cb62cd89339?rik=%2fjfB2KCzQlDJcg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9F201DADF1AA844906A672C95042B3A0D8C137FE
[accentColor] => 454545
)
[DD3A5ACD5657422D745F2569DD9149EFE14F7AA7] => Array
(
[name] => Question Bank PCE - reg - University of Mumbai Program: _First Year ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.Ci5xrTyMqd3xPpRfB86EDAAAAA?pid=Api
[datePublished] => 2022-11-29T18:48:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/b1c01902a18a3885a625b7dc189a90bc/thumb_300_388.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/question-bank-pce-reg/39098963
[contentSize] => 49276 B
[width] => 300
[height] => 388
[cDNContentUrl] => https://th.bing.com/th/id/R.0a2e71ad3c8ca9ddf13e945f07ce840c?rik=3aOl3GV1JNJH9Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7AA7F41EFE9419DD9652F547D2247565DCA5A3DD
[accentColor] => 089340
)
[989B069AA7AB45DCFDF8EF6F5CADFA582B9FADFA] => Array
(
[name] => Linear Search Algorithm - Python Programming (P2 Python) - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.UPTtb8N-HZ1B2Nfw4dJ7TgHaJl?pid=Api
[datePublished] => 2023-03-17T05:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/cec39b0f990589d52e6dfa2587bdb567/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/cmr-university/python-programming-p2-python/linear-search-algorithm/42776462
[contentSize] => 538274 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.50f4ed6fc37e1d9d41d8d7f0e1d27b4e?rik=iblgqXq6VM3fjw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AFDAF9B285AFDAC5F6FE8FDFCD54BA7AA960B989
[accentColor] => CC0000
)
[639662088D21D4B4EDC318804EA6A5A43F7E1D88] => Array
(
[name] => Aprende los Conceptos Básicos y Avanzados de Python en 30 minutos ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.6JOpShMxFKlYFiB6GrSDXgHaE8?pid=Api
[datePublished] => 2024-03-03T17:34:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://informaticoalrescate.com/wp-content/uploads/2024/03/python-scaled.webp
[hostPageUrl] => https://informaticoalrescate.com/2024/03/03/aprende-los-conceptos-basicos-y-avanzados-de-python-en-30-minutos/
[contentSize] => 201106 B
[width] => 2560
[height] => 1707
[cDNContentUrl] => https://th.bing.com/th/id/R.e893a94a133114a95816207a1ab4835e?rik=NmkmgNgSTUvePA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 88D1E7F34A5A6AE408813CDE4B4D12D880266936
[accentColor] => 0069CC
)
[B034B0AA39BFCD8EB3401FB7609E7332FF8B1F52] => Array
(
[name] => 2021 October IAT1 Ques Paper Solution PCOM-2021 - St. Francis Institute ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.dgLr53vSmnkgeOPRqeivgQHaJl?pid=Api
[datePublished] => 2023-01-14T10:20:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/eb811dabbfe0f8f78fa202ddd302eb42/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/st-francis-institute-of-technology/artificial-intelligence/2021-october-iat1-ques-paper-solution-pcom-2021/34611732
[contentSize] => 313307 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.7602ebe77bd29a792078e3d1a9e8af81?rik=C0MLqpP73Og7BA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 25F1B8FF2337E9067BF1043BE8DCFB93AA0B430B
[accentColor] => C5C506
)
[2F93481BE68B5D0636397D25C7D62F9F9D45822D] => Array
(
[name] => Quick Sort Algorithm implimentation in Python, Java with Examples
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.xHnGFSEs_PprPK9T-iHRzAHaD1?pid=Api
[datePublished] => 2024-06-20T15:28:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://lh7-us.googleusercontent.com/docsz/AD_4nXd_VD-PkxcpHnLp5ZJrgUXyIgh1ln6thyBna__49yH3YrOFSWdkcc2Qh8Lxf74uIcfnkpTWkump1uHsXt8HUBi2p4DpNRy43GStHkxkxr0e9E8hVx8Lpszk3rcO9yVUSd1-7BJUsaLsB6pNM5_70uOYNTw_?key=3_UPicvf_BgAHhUYi-MqCw
[hostPageUrl] => https://neptuneworld.in/blog/quick-sort-algorithm-implimentation-python-java-examples/
[contentSize] => 27789 B
[width] => 547
[height] => 283
[cDNContentUrl] => https://th.bing.com/th/id/R.c479c615212cfcfa6b3caf53fa21d1cc?rik=8jmEsW641WBjkw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D22854D9F9F26D7C52D7936360D5B86EB18439F2
[accentColor] => 0F374D
)
)
[relatedSearches] => Array
(
[0] => Array
(
[text] => DFS Algorithm
[displayText] => DFS Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5830.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=DFS+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[1] => Array
(
[text] => BFS DFS Graph
[displayText] => BFS DFS Graph
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+DFS+Graph&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5832.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+DFS+Graph
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+DFS+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[2] => Array
(
[text] => BFS vs DFS Algorithm
[displayText] => BFS vs DFS Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+vs+DFS+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5834.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+vs+DFS+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+vs+DFS+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[3] => Array
(
[text] => BFS Traversal
[displayText] => BFS Traversal
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Traversal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5836.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Traversal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+Traversal&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[4] => Array
(
[text] => BFS and DFS Differences
[displayText] => BFS and DFS Differences
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+and+DFS+Differences&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5838.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Differences
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+and+DFS+Differences&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[5] => Array
(
[text] => BFS and DFS Tree
[displayText] => BFS and DFS Tree
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+and+DFS+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5840.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+and+DFS+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[6] => Array
(
[text] => Recursive DFS
[displayText] => Recursive DFS
[webSearchUrl] => https://www.bing.com/images/search?q=Recursive+DFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5842.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Recursive+DFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Recursive+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[7] => Array
(
[text] => BFS Algorithm Example
[displayText] => BFS Algorithm Example
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Algorithm+Example&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5844.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Algorithm+Example
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+Algorithm+Example&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[8] => Array
(
[text] => What Is BFS and DFS
[displayText] => What Is BFS and DFS
[webSearchUrl] => https://www.bing.com/images/search?q=What+Is+BFS+and+DFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5846.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=What+Is+BFS+and+DFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=What+Is+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[9] => Array
(
[text] => Difference Between BFS and DFS
[displayText] => Difference Between BFS and DFS
[webSearchUrl] => https://www.bing.com/images/search?q=Difference+Between+BFS+and+DFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5848.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Difference+Between+BFS+and+DFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Difference+Between+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[10] => Array
(
[text] => BFS Pseudocode
[displayText] => BFS Pseudocode
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Pseudocode&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5850.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Pseudocode
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=BFS+Pseudocode&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[11] => Array
(
[text] => Depth First Search Algorithm
[displayText] => Depth First Search Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=Depth+First+Search+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5852.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Depth+First+Search+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Depth+First+Search+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[12] => Array
(
[text] => DFS Algo
[displayText] => DFS Algo
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Algo&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5854.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Algo
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=DFS+Algo&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[13] => Array
(
[text] => Ai BFS
[displayText] => Ai BFS
[webSearchUrl] => https://www.bing.com/images/search?q=Ai+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5856.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Ai+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Ai+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[14] => Array
(
[text] => Diff Between DFS and BFS
[displayText] => Diff Between DFS and BFS
[webSearchUrl] => https://www.bing.com/images/search?q=Diff+Between+DFS+and+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5858.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Diff+Between+DFS+and+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Diff+Between+DFS+and+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[15] => Array
(
[text] => BFS and DFS in Data Structure
[displayText] => BFS and DFS in Data Structure
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+and+DFS+in+Data+Structure&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5860.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+in+Data+Structure
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+and+DFS+in+Data+Structure&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[16] => Array
(
[text] => Graph Search Algorithms
[displayText] => Graph Search Algorithms
[webSearchUrl] => https://www.bing.com/images/search?q=Graph+Search+Algorithms&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5862.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Graph+Search+Algorithms
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Graph+Search+Algorithms&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[17] => Array
(
[text] => Breadth First Search and Depth First Search
[displayText] => Breadth First Search and Depth First Search
[webSearchUrl] => https://www.bing.com/images/search?q=Breadth+First+Search+and+Depth+First+Search&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5864.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Breadth+First+Search+and+Depth+First+Search
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Breadth+First+Search+and+Depth+First+Search&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[18] => Array
(
[text] => Time Complexity of BFS
[displayText] => Time Complexity of BFS
[webSearchUrl] => https://www.bing.com/images/search?q=Time+Complexity+of+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5866.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Time+Complexity+of+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Time+Complexity+of+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[19] => Array
(
[text] => Python DFS BFS
[displayText] => Python DFS BFS
[webSearchUrl] => https://www.bing.com/images/search?q=Python+DFS+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5868.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Python+DFS+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Python+DFS+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[20] => Array
(
[text] => DFS Stack
[displayText] => DFS Stack
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Stack&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5870.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Stack
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=DFS+Stack&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[21] => Array
(
[text] => Applications of BFS and DFS
[displayText] => Applications of BFS and DFS
[webSearchUrl] => https://www.bing.com/images/search?q=Applications+of+BFS+and+DFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5872.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Applications+of+BFS+and+DFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Applications+of+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[22] => Array
(
[text] => Compare BFS and DFS
[displayText] => Compare BFS and DFS
[webSearchUrl] => https://www.bing.com/images/search?q=Compare+BFS+and+DFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5874.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Compare+BFS+and+DFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Compare+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[23] => Array
(
[text] => DFS and BFS Problem
[displayText] => DFS and BFS Problem
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+and+BFS+Problem&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5876.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+and+BFS+Problem
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=DFS+and+BFS+Problem&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[24] => Array
(
[text] => DFS Runtime
[displayText] => DFS Runtime
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Runtime&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5878.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Runtime
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=DFS+Runtime&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[25] => Array
(
[text] => BFS vs Dijkstra
[displayText] => BFS vs Dijkstra
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+vs+Dijkstra&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5880.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+vs+Dijkstra
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+vs+Dijkstra&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[26] => Array
(
[text] => BFS Algorithm in C++
[displayText] => BFS Algorithm in C++
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Algorithm+in+C%2b%2b&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5882.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Algorithm+in+C%2b%2b
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=BFS+Algorithm+in+C%2b%2b&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[27] => Array
(
[text] => BFS Algorithm Question
[displayText] => BFS Algorithm Question
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Algorithm+Question&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5884.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Algorithm+Question
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=BFS+Algorithm+Question&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[28] => Array
(
[text] => BFS and DFS Algorithm in Discrete Mathematics
[displayText] => BFS and DFS Algorithm in Discrete Mathematics
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+and+DFS+Algorithm+in+Discrete+Mathematics&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5886.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Algorithm+in+Discrete+Mathematics
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+and+DFS+Algorithm+in+Discrete+Mathematics&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[29] => Array
(
[text] => BFS M DFS Graph
[displayText] => BFS M DFS Graph
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+M+DFS+Graph&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5888.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+M+DFS+Graph
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+M+DFS+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[30] => Array
(
[text] => BFS DFS Flowchart
[displayText] => BFS DFS Flowchart
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+DFS+Flowchart&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5890.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+DFS+Flowchart
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+DFS+Flowchart&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[31] => Array
(
[text] => BFS Matrix
[displayText] => BFS Matrix
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Matrix&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5892.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Matrix
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+Matrix&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[32] => Array
(
[text] => DFS Y BFS
[displayText] => DFS Y BFS
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Y+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5894.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Y+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=DFS+Y+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[33] => Array
(
[text] => DFS N BFS Algorithm
[displayText] => DFS N BFS Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+N+BFS+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5896.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+N+BFS+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=DFS+N+BFS+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[34] => Array
(
[text] => DFS Application
[displayText] => DFS Application
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Application&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5898.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Application
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=DFS+Application&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[35] => Array
(
[text] => Simple BFS Algorithm
[displayText] => Simple BFS Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=Simple+BFS+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5900.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Simple+BFS+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Simple+BFS+Algorithm&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[36] => Array
(
[text] => BFS DFS in Graph Theory
[displayText] => BFS DFS in Graph Theory
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+DFS+in+Graph+Theory&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5902.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+DFS+in+Graph+Theory
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+DFS+in+Graph+Theory&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[37] => Array
(
[text] => UCS Graph
[displayText] => UCS Graph
[webSearchUrl] => https://www.bing.com/images/search?q=UCS+Graph&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5904.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=UCS+Graph
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=UCS+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[38] => Array
(
[text] => BFS and DFS Sums
[displayText] => BFS and DFS Sums
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+and+DFS+Sums&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5906.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Sums
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+and+DFS+Sums&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[39] => Array
(
[text] => DFS Visualization
[displayText] => DFS Visualization
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Visualization&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5908.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Visualization
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=DFS+Visualization&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[40] => Array
(
[text] => Undirected Graph BFS
[displayText] => Undirected Graph BFS
[webSearchUrl] => https://www.bing.com/images/search?q=Undirected+Graph+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5910.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Undirected+Graph+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Undirected+Graph+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[41] => Array
(
[text] => BFS Dan DFS
[displayText] => BFS Dan DFS
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Dan+DFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5912.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Dan+DFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+Dan+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[42] => Array
(
[text] => DFS Pseudocode
[displayText] => DFS Pseudocode
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Pseudocode&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5914.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Pseudocode
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=DFS+Pseudocode&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[43] => Array
(
[text] => DFS Search
[displayText] => DFS Search
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Search&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5916.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Search
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=DFS+Search&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[44] => Array
(
[text] => BFS DFS Difference
[displayText] => BFS DFS Difference
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+DFS+Difference&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5918.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+DFS+Difference
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+DFS+Difference&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[45] => Array
(
[text] => What Is DFS and BFS
[displayText] => What Is DFS and BFS
[webSearchUrl] => https://www.bing.com/images/search?q=What+Is+DFS+and+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5920.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=What+Is+DFS+and+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=What+Is+DFS+and+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[46] => Array
(
[text] => DFS Code
[displayText] => DFS Code
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Code&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5922.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Code
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=DFS+Code&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[47] => Array
(
[text] => BFS Animation
[displayText] => BFS Animation
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Animation&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5924.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Animation
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+Animation&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[48] => Array
(
[text] => BFS and DFS Examples
[displayText] => BFS and DFS Examples
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+and+DFS+Examples&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5926.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Examples
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+and+DFS+Examples&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[49] => Array
(
[text] => Example of BFS and DFS
[displayText] => Example of BFS and DFS
[webSearchUrl] => https://www.bing.com/images/search?q=Example+of+BFS+and+DFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5928.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Example+of+BFS+and+DFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Example+of+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
)
[createdate] => 1778029978171
)
[json_error] => No error
[products_count] => 120
[related_searches_count] => 50
[first_product_sample] => Array
(
[name] => Practical 1 - SSXS: Implementing DFS & BFS Algorithms in Python - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.xvZEJep5_wF-Oo82Jl5qNQHaKd?pid=Api
[datePublished] => 2025-09-22T20:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/c1d1cb5f5682d68c0b80e12411624a5b/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-mumbai/tybsc-physics-mathematical-methods-in-physics/practical-1-ssxs-implementing-dfs-bfs-algorithms-in-python/139277905
[contentSize] => 291373 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.c6f64425ea79ff017e3a8f36265e6a35?rik=QNMAAFfwEg1TUw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 8C5906A2DE77FFB0A9C453530D12F0570000D340
[accentColor] => 2F2F2F
)
)
[skipped_products] => Array
(
)
)
How to Discover Better Bfs And Dfs Algorithm Python Options
Try combining terms like fit, fabric, or occasion with your core query. For example, add words like oversized, linen, party, office, or wedding to get more targeted fashion product discovery results.
Search Help
Are these results from one store only?
No, Styleberry is a discovery layer that surfaces fashion products from multiple sources to simplify comparison.
Can I search using occasion terms like office or wedding?
Yes, occasion keywords often produce stronger and more relevant results for fashion discovery.