Difference between shortest path and minimum spanning tree

Difference between minimum spanning tree and shortest path
Definition ：
　　　　 The minimum spanning tree can ensure the minimum sum of all paths of the entire topology , But there is no guarantee that there is the shortest path between any two points .
　　　　 The shortest path is from one point , The path to the destination is the smallest .

summary ：
　　　　 When encountering the problem of minimizing the sum of all paths, use the minimum spanning tree & And search the set to solve ;
　　　　 When encountering the problem of finding the shortest path between two points, use the shortest path , That is, the shortest path from one city to another .

difference ：
　　　　 After the minimum spanning tree is formed, all points are connected , The shortest way is to take the shortest path to the destination , It has nothing to do with the connection or disconnection of all points .