最短路中的广度优先搜索，Dijkstra算法。网络算路问题的更优算法实现对于网络资源高效配置具有重要价值。题目是：给定一个带权重的有向图 G (V,E)，V 为顶点集，E 为有向边集，每一条有向边均有一个权 重。对于给定的顶点 s、t，以及 V 的子集 V ，寻找从 s 到 t 的不成环有向路径 P，使得 P 经过 V 中所有的顶点(对经过 V 中节点的顺序不做要求)。

若不存在这样的有向路径 P，则输出无解，程序运行时间越短，则视为结果越优；若存在这 样的有向路径 P，则输出所得到的路径，路径的权重越小，则视为结果越优，在输出路径权 重一样的前提下，程序运行时间越短，则视为结果越优。-Shortest in the BFS, Dijkstra algorithm. Better network algorithm calculates a path for network problems to achieve efficient allocation of resources of great value. Title is: Given a weighted directed graph G　 (V, E), V is the set of vertices, E is set to have the edge, each side has to have a weight. For a given vertex s, t, and V subset V　, looking　s to t acyclic directed path P, such that P through V　in all vertices (elapsed V　nodes in order not to Claim).

If there is a directed path P, the output is no solution, the shorter the time the program runs, the more the result is considered excellent　if there is a directed path P, the resulting output path, the path of the right weight is smaller, it is considered more excellent results in the output path weight the same premise, the shorter the time the program runs, the more the result is considered excellent.