OJ Board

Hi All...
I'm a beginner in Algorithms stuff.. I read about Floyd Warshall Algo to find Min Path & also I read about MST (Minimum spanning tree).. & I was just wondering.. when to use this Algo & when to use the other one while solving any problem that requires Min path or sth???

Thanks in Advace..

When you need shortest distance from any vertex to anyother vertex, you can use All pairs shortest paths(Floyd-Warshall's). When you need a least cost path which connects all the vertices in a graph, use the MST.