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
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










