diff options
| author | Vladimir Byko-Ianko <v.bykoianko@corp.mail.ru> | 2016-05-26 14:23:53 +0300 |
|---|---|---|
| committer | Vladimir Byko-Ianko <v.bykoianko@corp.mail.ru> | 2016-05-27 14:17:14 +0300 |
| commit | 9d393d2b51224681a090c76399db3e1f6b8bd10b (patch) | |
| tree | c24bbac5a2e2cd76bc53e7902d85891a91ef4da9 /pedestrian_routing_tests | |
| parent | e060fd2fa6898a41d8f849b8d575dd17cd1d2bb4 (diff) | |
Creating routing mode intead of using onewayAsBidirectional flag.
Diffstat (limited to 'pedestrian_routing_tests')
| -rw-r--r-- | pedestrian_routing_tests/pedestrian_routing_tests.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/pedestrian_routing_tests/pedestrian_routing_tests.cpp b/pedestrian_routing_tests/pedestrian_routing_tests.cpp index d7733240f7..3c7598eb07 100644 --- a/pedestrian_routing_tests/pedestrian_routing_tests.cpp +++ b/pedestrian_routing_tests/pedestrian_routing_tests.cpp @@ -95,7 +95,7 @@ unique_ptr<routing::IRouter> CreatePedestrianAStarTestRouter(Index & index, stor unique_ptr<routing::IVehicleModelFactory> vehicleModelFactory(new SimplifiedPedestrianModelFactory()); unique_ptr<routing::IRoutingAlgorithm> algorithm(new routing::AStarRoutingAlgorithm()); unique_ptr<routing::IRouter> router(new routing::RoadGraphRouter( - "test-astar-pedestrian", index, UKGetter, true /* onewayAsBidirectional */, + "test-astar-pedestrian", index, UKGetter, routing::IRoadGraph::Mode::IgnoreOnewayTag, move(vehicleModelFactory), move(algorithm), nullptr)); return router; } @@ -106,7 +106,7 @@ unique_ptr<routing::IRouter> CreatePedestrianAStarBidirectionalTestRouter(Index unique_ptr<routing::IVehicleModelFactory> vehicleModelFactory(new SimplifiedPedestrianModelFactory()); unique_ptr<routing::IRoutingAlgorithm> algorithm(new routing::AStarBidirectionalRoutingAlgorithm()); unique_ptr<routing::IRouter> router(new routing::RoadGraphRouter( - "test-astar-bidirectional-pedestrian", index, UKGetter, true /* onewayAsBidirectional */, + "test-astar-bidirectional-pedestrian", index, UKGetter, routing::IRoadGraph::Mode::IgnoreOnewayTag, move(vehicleModelFactory), move(algorithm), nullptr)); return router; } @@ -124,7 +124,7 @@ m2::PointD GetPointOnEdge(routing::Edge & e, double posAlong) void GetNearestPedestrianEdges(Index & index, m2::PointD const & pt, vector<pair<routing::Edge, m2::PointD>> & edges) { unique_ptr<routing::IVehicleModelFactory> vehicleModelFactory(new SimplifiedPedestrianModelFactory()); - routing::FeaturesRoadGraph roadGraph(index, true /* onewayAsBidirectional */, + routing::FeaturesRoadGraph roadGraph(index, routing::IRoadGraph::Mode::IgnoreOnewayTag, move(vehicleModelFactory)); roadGraph.FindClosestEdges(pt, 1 /*count*/, edges); |