Fix inserting edges of shortest path for sharing check
This caused very sub-optimal routes to be selected.
This commit is contained in:
parent
89f6e2d55b
commit
1990de7dcc
@ -402,7 +402,7 @@ template <typename RandIt> RandIt filterUnpackedPathsBySharing(RandIt first, Ran
|
|||||||
std::unordered_set<EdgeID> edges;
|
std::unordered_set<EdgeID> edges;
|
||||||
edges.reserve(size * shortest_path.edges.size() * (1. + kAtMostLongerBy));
|
edges.reserve(size * shortest_path.edges.size() * (1. + kAtMostLongerBy));
|
||||||
|
|
||||||
edges.insert(begin(shortest_path.edges), begin(shortest_path.edges));
|
edges.insert(begin(shortest_path.edges), end(shortest_path.edges));
|
||||||
|
|
||||||
const auto over_sharing_limit = [&](const auto &unpacked) {
|
const auto over_sharing_limit = [&](const auto &unpacked) {
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user