C#中实现最短路，该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the edges, and each side has a corre

用C实现一个校园导游系统，能实现本校的景点查询和计算任意两景点间的最短路径。-Using C to achieve a campus tour guide system, to achieve the university s attractions arbitrary query and calculation of the two shortest path between attractions.