Question: what is the difference between shortest path and minimum spanning tree?
Answer: What is the difference between minimum spanning tree algorithm and a shortest path algorithm? ... Minimum spanning tree is a tree in a graph that spans all the vertices and total weight of a tree is minimal. Shortest path is quite obvious, it is a shortest path from one vertex to another.