图论部分的MPI源码，包括传递闭包、连通分量、最短路径和最小生成树，附带说明和测试用例-Graph Theory part of the MPI source code, including the transitive closure, connected components, shortest path and minimum spanning tree, with instructions and test cases

采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.

Floyd的最短路径MPI程序，给定N×N的矩阵，矩阵是各个点之间距离，然后计算最短距离。是很好的MPI实例程序。 -Floyd s all-pairs shortest path