Code for Game Developers - Breadth First Search @JorgeVinoRodriguez
Code for Game Developers - Breadth First Search  @JorgeVinoRodriguez
Uploaded July 2014 | Updated November 2026, 3 hours ago
By changing how we use our stack we can traverse the graph in a way that maintains an even distance from the starting point node. This is a breadth first search, and it will always find a solution that represents the shortest number of edge traversals.

Find the source code here: github.com/BSVino/MathForGameDevelopers/tree/graph-breadthfirst

New video every Thursday. Question? Leave a comment below, or ask me on Twitter: twitter.com/VinoBS
Code for Game Developers - Breadth First Search#ROCKTOBER DAY 29Math for Game Developers - Character Movement 7 (Cross Product)Math for Game Developers - Crazy Collisions (Newtons Method)Programming and Math - Stream Dec 6 (1/2)Math for Game Developers - Backstabbing Part 2Final Fantasy 7 Original Vs Remake Part 6: Cat HerdingFinal Fantasy 7 Original Vs Remake Part 15: AverleCode for Game Developers - OptimizationMath for Game Developers - Simpsons Rule#ROCKTOBER DAY 11Math for Game Developers - Explosions! (The Remap Function)
Jorge Rodriguez |

Code for Game Developers - Breadth First Search

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER