diff options
| author | tatiana-kondakova <tatiana.kondakova@gmail.com> | 2017-09-27 20:19:05 +0300 |
|---|---|---|
| committer | Yuri Gorshenin <mipt.vi002@gmail.com> | 2017-09-28 14:40:01 +0300 |
| commit | d80723c27b913301ef1adfeb640db56ae4e9b439 (patch) | |
| tree | 0ebfca6d0a0d425d67f8b3be4040de0143a01e8d /routing/index_router.cpp | |
| parent | 688fd5f473109c90982803f33882c6f0a23671f1 (diff) | |
Hide WorldGraph implementation details
Diffstat (limited to 'routing/index_router.cpp')
| -rw-r--r-- | routing/index_router.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/routing/index_router.cpp b/routing/index_router.cpp index c09a2e02d1..b2db2c5195 100644 --- a/routing/index_router.cpp +++ b/routing/index_router.cpp @@ -140,7 +140,7 @@ bool IsDeadEnd(Segment const & segment, bool isOutgoing, WorldGraph & worldGraph // If |isOutgoing| == false it's the finish. So ingoing edges are looked for. auto const getOutgoingEdgesFn = [isOutgoing](WorldGraph & graph, Segment const & u, vector<SegmentEdge> & edges) { - graph.GetEdgeList(u, isOutgoing, false /* isLeap */, edges); + graph.GetEdgeList(u, isOutgoing, false /* isLeap */, false /* isEnding */, edges); }; return !CheckGraphConnectivity(segment, kDeadEndTestLimit, worldGraph, |