Description: Run the application of this procedure, enter the node number n and m nodes in all three groups of information. m a triple (it, jt, ft), t = 1,2, ... ..., m, two nodes between it and jt direct connection bi-directional connections, the distance of ft. Enter the node g (1 ≤ g ≤ n), the procedure will be calculated by each node g to achieve the best routing. And display the output results.
- [Dijkstra_router] - Dijkstra shortest path algorithm, can be
- [vctuxianghuidu] - image of a gray transform vc code collec
- [Fast_Dijkstra] - Time complexity is O (ElogV) of Dijkrast
- [Tsp] - use ant algorithm to solve the traveling
- [shuanfa2] - Order to map any of the distance between
File list (Check if you may need any files):
Download