附件中是Dantjig标号算法的C语言实现，其中的边赋权图是根据《图论》中12页的例子来的。-It s an implementation of Dantjig Algorithm, according to Graph theory and Its Application P12.

dantjig算法球最短路径,可以求出一个图中各点到某点的最短距离，也称为标号法求最短路径。-dantjig algorithm, which can find the shortest path in a graph.