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 |
||
|---|---|---|
| .. | ||
| alternative_path.hpp | ||
| direct_shortest_path.hpp | ||
| many_to_many.hpp | ||
| map_matching.hpp | ||
| routing_base.hpp | ||
| shortest_path.hpp | ||
| tsp_brute_force.hpp | ||
| tsp_farthest_insertion.hpp | ||
| tsp_nearest_neighbour.hpp | ||