Uploaded August 2014 | Updated November 2026, 2 hours ago
With a very simple addition to Dijkstra's Algorithm, considering the distance to the target node, we can find the goal node much faster.
Find the source code here: github.com/BSVino/MathForGameDevelopers/tree/graph-astar
New video every Thursday. Question? Leave a comment below, or ask me on Twitter: twitter.com/VinoBS
With a very simple addition to Dijkstra's Algorithm, considering the distance to the target node, we can find the goal node much faster.
Find the source code here: github.com/BSVino/MathForGameDevelopers/tree/graph-astar
New video every Thursday. Question? Leave a comment below, or ask me on Twitter: twitter.com/VinoBS










