filmov
tv
How to traverse a matrix, DFS algorithm | depth first search | bfs vs dfs
![preview_player](https://i.ytimg.com/vi/tD-58yLHYYg/maxresdefault.jpg)
Показать описание
Breadth first search or depth first search? In this video we'll explain the graph theory behind these 2 algorithms and then we will implement a simple dfs algorithm in python!
The ROAD TO A* Series:
We will have a look at the main algorithms for finding a path inside a "ground" matrix, these will be the topics covered:
1. BFS
2. DFS
3. Dijkstra
4. Greedy Best First Search
5. A*
👨💼About me:
Hey guys!
I'm new here, so I'll introduce myself, don't worry I'll be quick!
I'm a game developer, student and entrepreneur that is currently pursuing my Master's degree in Milan, Italy.
I love Computer Science 👨💻, I know it's a huuuuuge field, but as a Game Developer I really like Computer Graphics and algorithms that lays behind games and applications!
In my academic years i developed many applications that concerns Computer Graphics, in particular I love procedural generation of contents and shader programming (I promise I'll bring some content about this topic in future or soon if you ask it!) also I like to participate in Game Jams to challenge myself every single year, and obviously learn new fun things.
I develop small games and applications in may languages and frameworks, but my favourite tool is Unity, even though Unreal Engine is (basically) better, if you want to take a look at one of my video games I'll leave a link down below!
To give you an idea of my work I'll leave there my personal repo so that you can observe (and maybe ask how did i do that) all my personal projects:
🔉Contents of this video:
0:00 Intro
1:07 Practical explanation of the DFS algorithm
1:28 The Stack data structure
2:41 How does a LIFO stack behave
5:02 Code
5:27 The DFS algorithm
8:58 Results
BitBucket ✈️:
Instagram 📸:
Twitter 🐦 :
Facebook 📖 (oops are they Meta now? 🌚):
If you have some game (or any CG related project) don't hesitate to contact me, maybe I can do a video where I challenge myself to complete that task! 🤓
Hope to hear you soon,
Your funny Italian guy Davide!
#bfs #dfs #pathfinding
The ROAD TO A* Series:
We will have a look at the main algorithms for finding a path inside a "ground" matrix, these will be the topics covered:
1. BFS
2. DFS
3. Dijkstra
4. Greedy Best First Search
5. A*
👨💼About me:
Hey guys!
I'm new here, so I'll introduce myself, don't worry I'll be quick!
I'm a game developer, student and entrepreneur that is currently pursuing my Master's degree in Milan, Italy.
I love Computer Science 👨💻, I know it's a huuuuuge field, but as a Game Developer I really like Computer Graphics and algorithms that lays behind games and applications!
In my academic years i developed many applications that concerns Computer Graphics, in particular I love procedural generation of contents and shader programming (I promise I'll bring some content about this topic in future or soon if you ask it!) also I like to participate in Game Jams to challenge myself every single year, and obviously learn new fun things.
I develop small games and applications in may languages and frameworks, but my favourite tool is Unity, even though Unreal Engine is (basically) better, if you want to take a look at one of my video games I'll leave a link down below!
To give you an idea of my work I'll leave there my personal repo so that you can observe (and maybe ask how did i do that) all my personal projects:
🔉Contents of this video:
0:00 Intro
1:07 Practical explanation of the DFS algorithm
1:28 The Stack data structure
2:41 How does a LIFO stack behave
5:02 Code
5:27 The DFS algorithm
8:58 Results
BitBucket ✈️:
Instagram 📸:
Twitter 🐦 :
Facebook 📖 (oops are they Meta now? 🌚):
If you have some game (or any CG related project) don't hesitate to contact me, maybe I can do a video where I challenge myself to complete that task! 🤓
Hope to hear you soon,
Your funny Italian guy Davide!
#bfs #dfs #pathfinding
Комментарии