求最大流的Dinic和SAP算法的实现,各自有递归与非递归版本。在稀疏图上效果比较好。-Dinic for the maximum flow algorithm and the SAP implementation, each of which has recursive and non-recursive version. Effect on the sparse map is better.
将VC7.0和VC.NET的工程转换到VC6.0的工程,内有详细的介绍做法(自己试验后写的)-VC7.0 and VC.NET will convert the project to VC6.0 project, which has a detailed introduction of the practice (their own written tests)
用c写的校园导游系统 用弗洛依德算法实现,能够查询校园任意两个景点的最佳路径.-used to write c campus tour guide system with Floyd algorithm, inquiries to the campus arbitrary two spots in the best path.