旅行商算法，实现从加权有向图中寻找并输出最短的闭合路径-Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure

在一个带权有向连通图G中，给定出发点v，求出它到所有点的最短路径长度-In a weighted directed connected graph G, given the starting point v, find it to all points of shortest path length

从校园地图中选取有代表性景点，抽象成一个无向带权图。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息。可查询景点信息和两景点的最短路径。-Choose a representative the campus map attractions, abstracted into an undirected weighted graph. Vertex to map the school attractions representation, storage attractions names

求解带权有向图中单源点的最短路径问题，在图论中有很好的应用(The shortest path problem of single source in weighted directed graph)