Description: Weighted Dijkstra and breadth first search based on a shortest path algorithm must point to the map, the path must pass through points, and not a ring.
This algorithm adopts an adaptive method to adjust, after several iterations, the convergence of solution. But only to find a slightly better feasible solution (each iteration is based on the greedy algorithm to find), can not guarantee the optimal solution. And if the graph is too sparse, because the convergence speed is too fast, it may lead to the problem of no solution (convergence to a local optimal solution, not after all points). To solve the relatively dense graphs (each entry point average above 4), good performance.
To Search:
File list (Check if you may need any files):
3.29\3.29\321.pro
....\....\graph.h
....\....\graph.cpp
....\....\321.pro.user.6b31396
....\....\CMakeLists.txt
....\....\future_net.cpp
....\....\321.pro.user
....\....\indexminpq.cpp
....\....\indexminpq.h
....\....\io.cpp
....\....\lib\lib_io.h
....\....\...\lib_record.h
....\....\...\lib_time.h
....\....\main.cpp
....\....\route.cpp
....\....\route.h
....\....\321.pro.user.1ec661f
....\....\lib
....\3.29
3.29
Download