Uploaded August 2014 | Updated November 2026, 3 hours ago
We want to speed up Dijkstra's Algorithm by avoiding the linear O(n) scan through all unvisited notes. To do this we put our nodes in a heap, which allows us to always quickly access the fastest node.
Find the source code here: github.com/BSVino/MathForGameDevelopers/tree/graph-heap
New video every Thursday. Question? Leave a comment below, or ask me on Twitter: twitter.com/VinoBS
We want to speed up Dijkstra's Algorithm by avoiding the linear O(n) scan through all unvisited notes. To do this we put our nodes in a heap, which allows us to always quickly access the fastest node.
Find the source code here: github.com/BSVino/MathForGameDevelopers/tree/graph-heap
New video every Thursday. Question? Leave a comment below, or ask me on Twitter: twitter.com/VinoBS










