Shortest path tree different than minimum spanning tree My professor brought up in class that a shortest path tree can be different than minimum spanning tree for an undirected graph. However, I have not been able to find a case where this is possible.

Remember that the shortest path is between two points, while the minimum spanning tree is the tree that spans the entire graph, and not just two points.
If you consider a triangle with side lengths of 1, can you see the MSP and the minimum path between all pairs of vertices in your head? do they differ for one pair of vertices?
