Talk:Dijkstra's algorithm

From Algorithmist
Jump to navigation Jump to search

I think it is wrong to claim that Dijkstra could be used to find MST. The algorithm that is similiar to Dijkstra that is used to find MST is called Prim's and not Dijkstra. --Roticv 03:23, 24 Dec 2005 (EST)

Shortest path spanning tree isn't a minimum spanning tree. --Larry 05:55, 24 Dec 2005 (EST)