It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used ... creating a minimum spanning tree. One of the first algorithms for this is Jarník’s algorithm ...