أينشتاين مصر (14) || شرح ال Grokking Algorithms - Breadth First Search скачать в хорошем качестве

أينشتاين مصر (14) || شرح ال Grokking Algorithms - Breadth First Search

Welcome to the fourteenth video in our "Grokking Algorithms" series on Egypt's Einstein channel! In this dedicated episode, we dive into the fascinating world of "Breadth First Search (BFS)," a crucial graph traversal algorithm discussed in Chapter 6 of our enlightening series. 📺 Playlist Link:   • أينشتاين مصر || Grokking Algorithms in Arabic   As we explore this essential algorithm, we'll break down the mechanics of BFS, showing how it systematically explores nodes layer by layer. BFS is not only foundational for understanding graph theory but also has practical applications in areas like social network analysis, shortest path finding, and more. Our discussion will cover: The step-by-step process of implementing BFS. Key concepts such as the queue data structure used in BFS. Practical examples to solidify your understanding. BFS applications in real-world scenarios. Join us on this educational journey as we unravel the principles and applications of BFS, providing you with the tools and knowledge to implement and utilize this powerful algorithm in your own programming projects. By the end of this episode, you'll be well-equipped to apply BFS confidently and effectively. If you find this exploration valuable, give it a thumbs up, and ensure you subscribe to our channel for more captivating episodes. Let's continue advancing through the world of data structures and algorithms together! 🚀 ---------------------------------------------------------------------------------------------- محتوي الفيديو:- 00:00​ - مقدمة قناة أينشتاين مصر 00:07 - Introduction 01:14 - Data Types and Corresponding Algorithms 09:13 - What's Graph? 13:36 - In this chapter (6) 20:40 - Introduction to graphs in Grokking Algorithms Book 34:03 - Breadth First Search (BFS) in Grokking Algorithms Book 51:43 - Queues 56:40 - Breadth First Search (BFS) in details 01:10:33 - EXERCISES Part 1 01:14:00 - Implementing the graph in Grokking Algorithms Book 01:22:15 - Implementing the algorithm (BFS) in Grokking Algorithms Book 01:35:07 - Implementing Graph & BFS with code at Colab 01:42:30 - Running time of BFS 01:44:52 - Tree 01:55:45 - EXERCISES Part 2 02:04:53 - Recap for Ch6 02:07:07 - The End ---------------------------------------------------------------------------------------------- #أينشتاين_مصر #BreadthFirstSearch #GraphAlgorithms #Algorithm #GrokkingAlgorithms #DataStructures ╔═.♥. ════════════════════════════════════╗ ＳＵＢＳＣＲＩＢＥ | ＬＩＫＥ | ＣＯＭＭＥＮＴ | ＳＨＡＲＥ | ► Subscribe إشترك ✔    / @einshtenmisr   لاتنسوا الاشتـــــــراك في القنــــاة ✔ ولايـك للفيديو ✔ مشاهدة طيبة أعزائي الكرام ╚══════.♥. ═════════════════════════ #أينشتاين_مصر #Mahmoud_Alyosify https://MahmoudAlyosifySite.github.io/   / einshtenmisr     / mahmoudalyosify   Gmail:mahmoudalyosify@gmail.com Yahoo :mahmoudalyosify@yahoo.com