计算最短路径的一种简易方法，在DIJKSTRA算法基础上有所改进-Calculate the shortest path, a simple method based on the DIJKSTRA algorithm improvements

银行家算法模拟 可用于实习交作业等等 实用-Banker s algorithm simulation

简单的最短路计算方法，包含dijk ， spfa ,kruskal算法同时，加上了一些优化，体现三者对于图的疏密程度，对算法的影响。-Simple shortest path calculation method, contains dijk spfa kruskal algorithm at the same time, plus some optimization embodies the density of the three graph algorithm.

Dijkstra算法解决voronoi图的问题(The Dijkstra algorithm solves the problem of voronoi diagram)