Very good collection of c++ source code. Implementation of diffrents alghoritms in graph theory, such as floyd,fulkerson. dijkstra,warshall, binary tree,map coloring,vertex cover.

dijkstra floyd 匈牙利算法 最小流算法-dijkstra floyd minimum flow algorithm Hungarian algorithm

在上传的资料‘tulun’中，PPT详细介绍了图论中的基本概念，并且给出了相应程序的算法，另外附有最短路Floyd算法的源程序和dijkstra的源程序。有利于在建模过程中利用MATLAB求解图论的相关问题。-PPT paper introduces the basic concepts of graph theory, algorithms and gives the corresponding program.Floyd also accompanied by the shortest ro