Uploaded August 2014 | Updated November 2026, 2 hours ago
We want an algorithm that can search a path whose edges are weighted. Weighted edges indicate how difficult it is to travel along a path. By keeping track of how far we've traveled so far, we can make sure we always take the lowest cost path.
Find the source code here: github.com/BSVino/MathForGameDevelopers/tree/graph-dijkstra
New video every Thursday. Question? Leave a comment below, or ask me on Twitter: twitter.com/VinoBS
We want an algorithm that can search a path whose edges are weighted. Weighted edges indicate how difficult it is to travel along a path. By keeping track of how far we've traveled so far, we can make sure we always take the lowest cost path.
Find the source code here: github.com/BSVino/MathForGameDevelopers/tree/graph-dijkstra
New video every Thursday. Question? Leave a comment below, or ask me on Twitter: twitter.com/VinoBS










