Chau Nguyen b15f8f68e4 refactor and improve the round trip computation of multiple SCCs ...

Problem:
- old solution was slow
- depending on the result of TarjanSCC, new distance tables and new phantom node vectors were created to run tsp on it

Solution:
- dont create new distance tables and phantom node vectors
- pass an additional vector with the information which locations are in the same component and ignore all others

fix bug for scc split computation

2015-09-01 15:20:33 +02:00

..

alternative_path.hpp

Fix inversion of sign

2015-06-17 23:25:16 +02:00

direct_shortest_path.hpp

Make sure to terminate when the core heaps are empty

2015-08-19 12:27:44 +02:00

many_to_many.hpp

use CRTP instead of virtual functions in routing plugins

2015-03-02 11:55:55 +01:00

map_matching.hpp

Move calculate_coordinate to algorithms/

2015-08-12 13:02:18 +02:00

routing_base.hpp

Move calculate_coordinate to algorithms/

2015-08-12 13:02:18 +02:00

shortest_path.hpp

Fix inversion of sign

2015-06-17 23:25:16 +02:00

tsp_brute_force.hpp

refactor and improve the round trip computation of multiple SCCs

2015-09-01 15:20:33 +02:00

tsp_farthest_insertion.hpp

refactor and improve the round trip computation of multiple SCCs

2015-09-01 15:20:33 +02:00

tsp_nearest_neighbour.hpp

refactor and improve the round trip computation of multiple SCCs

2015-09-01 15:20:33 +02:00