For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex.

POJ专题分类,按算法分类，包含基本算法、图算法、数据结构、简单搜索、动态规划、数学、数论、计算几何等-POJ thematic classification algorithm segments, including basic algorithms, graph algorithms, data structures, a simple search, dynamic programming, mathematics, number theory, computational geometr