C语言版的链表实现。带头节点的双向循环链表。访STL vector的实现。-C language version of the linked list implementation. Two-way circular list node to take the lead. Visit STL vector implementation.

在路径最大长度给定的前提下。在节点网络中找从各个节点出发的最短路径。-find several routes in the network and the total distance of these route is minimal and dont exceed the maximal distance of the route.