Homepage › Solution manuals › Gilbert Strang › Linear Algebra and Learning from Data › Exercise 4.7.10
The minimum spanning tree found by Dijkstra’s algorithm is: (8,0) → (4,0) → (0,0) → (1,0) → (3,0)
