#include <gtest/gtest.h>#include <lanelet2_core/primitives/LaneletSequence.h>#include <algorithm>#include "lanelet2_routing/RoutingGraph.h"#include "lanelet2_routing/internal/Graph.h"#include "lanelet2_routing/internal/ShortestPath.h"#include "test_routing_map.h"
Go to the source code of this file.
Classes | |
| class | ConfigurationInitialization |
Functions | |
| template<typename LaneletsT > | |
| bool | containsLanelet (const LaneletsT &reachableSet, Id lltId) |
| GraphType | getSimpleGraph () |
| TEST (DijkstraSearch, onSimpleGraph) | |
| TEST (RoutingCostInitialization, NegativeLaneChangeCost) | |
| TEST_F (ConfigurationInitialization, Config) | |
| TEST_F (ConfigurationInitialization, EmptyConfig) | |
| TEST_F (ConfigurationInitialization, NoConfig) | |
| TEST_F (GermanBicycleGraph, NumberOfLanelets) | |
| TEST_F (GermanPedestrianGraph, forEachPredecessorIncludingAreasReachesLanelet) | |
| TEST_F (GermanPedestrianGraph, forEachSuccessorIncludingAreasReachesLanelet) | |
| TEST_F (GermanPedestrianGraph, NumberOfLanelets) | |
| TEST_F (GermanPedestrianGraph, possiblePathsWithAreaFromLanelet) | |
| TEST_F (GermanPedestrianGraph, possiblePathsWithAreaFromUnconnectedLanelet) | |
| TEST_F (GermanPedestrianGraph, reachableSetCrossingWithArea) | |
| TEST_F (GermanPedestrianGraph, reachableSetStartingFromArea) | |
| TEST_F (GermanPedestrianGraph, reachableSetWithAreaFromTwoWayLanelet) | |
| TEST_F (GermanPedestrianGraph, reachableSetWithAreaFromUnconnectedLanelet) | |
| TEST_F (GermanPedestrianGraph, shortestPathIncludingAreasFromArea) | |
| TEST_F (GermanPedestrianGraph, shortestPathIncludingAreasThroughAreas) | |
| TEST_F (GermanPedestrianGraph, shortestPathIncludingAreasViaThroughAreas) | |
| TEST_F (GermanVehicleGraph, forEachPredecessorIncludingAreasReachesLanelet) | |
| TEST_F (GermanVehicleGraph, forEachPredecessorReachesLanelet) | |
| TEST_F (GermanVehicleGraph, forEachSuccessorIsMonotonic) | |
| TEST_F (GermanVehicleGraph, GetShortestPath) | |
| TEST_F (GermanVehicleGraph, GetShortestPathInvalid) | |
| TEST_F (GermanVehicleGraph, GetShortestPathMaxHose) | |
| TEST_F (GermanVehicleGraph, GetShortestPathVia1) | |
| TEST_F (GermanVehicleGraph, GetShortestPathVia2) | |
| TEST_F (GermanVehicleGraph, GetShortestPathViaInvalid) | |
| TEST_F (GermanVehicleGraph, possiblePathsIncludeShorterAllLimitsLc) | |
| TEST_F (GermanVehicleGraph, possiblePathsIncludeShorterAllLimitsNoLc) | |
| TEST_F (GermanVehicleGraph, possiblePathsIncludeShorterLc) | |
| TEST_F (GermanVehicleGraph, possiblePathsIncludeShorterNoLc) | |
| TEST_F (GermanVehicleGraph, possiblePathsInvalid) | |
| TEST_F (GermanVehicleGraph, possiblePathsLimitLengthNoLc) | |
| TEST_F (GermanVehicleGraph, possiblePathsMaxHose) | |
| TEST_F (GermanVehicleGraph, possiblePathsMinLanelets) | |
| TEST_F (GermanVehicleGraph, possiblePathsMinRoutingCosts) | |
| TEST_F (GermanVehicleGraph, possiblePathsTowardsMinLanelets) | |
| TEST_F (GermanVehicleGraph, possiblePathsTowardsWithLc) | |
| TEST_F (GermanVehicleGraph, possiblePathsTowardsWithoutLc) | |
| TEST_F (GermanVehicleGraph, reachableSet) | |
| TEST_F (GermanVehicleGraph, reachableSetInvalid) | |
| TEST_F (GermanVehicleGraph, reachableSetMaxHose) | |
Function Documentation
◆ containsLanelet()
| bool containsLanelet | ( | const LaneletsT & | reachableSet, |
| Id | lltId | ||
| ) |
Definition at line 204 of file test_routing.cpp.
◆ getSimpleGraph()
| GraphType getSimpleGraph | ( | ) |
Definition at line 16 of file test_routing.cpp.
◆ TEST() [1/2]
| TEST | ( | DijkstraSearch | , |
| onSimpleGraph | |||
| ) |
Definition at line 47 of file test_routing.cpp.
◆ TEST() [2/2]
| TEST | ( | RoutingCostInitialization | , |
| NegativeLaneChangeCost | |||
| ) |
Definition at line 486 of file test_routing.cpp.
◆ TEST_F() [1/40]
| TEST_F | ( | ConfigurationInitialization | , |
| Config | |||
| ) |
Definition at line 509 of file test_routing.cpp.
◆ TEST_F() [2/40]
| TEST_F | ( | ConfigurationInitialization | , |
| EmptyConfig | |||
| ) |
Definition at line 505 of file test_routing.cpp.
◆ TEST_F() [3/40]
| TEST_F | ( | ConfigurationInitialization | , |
| NoConfig | |||
| ) |
Definition at line 514 of file test_routing.cpp.
◆ TEST_F() [4/40]
| TEST_F | ( | GermanBicycleGraph | , |
| NumberOfLanelets | |||
| ) |
Definition at line 77 of file test_routing.cpp.
◆ TEST_F() [5/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| forEachPredecessorIncludingAreasReachesLanelet | |||
| ) |
Definition at line 431 of file test_routing.cpp.
◆ TEST_F() [6/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| forEachSuccessorIncludingAreasReachesLanelet | |||
| ) |
Definition at line 420 of file test_routing.cpp.
◆ TEST_F() [7/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| NumberOfLanelets | |||
| ) |
Definition at line 67 of file test_routing.cpp.
◆ TEST_F() [8/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| possiblePathsWithAreaFromLanelet | |||
| ) |
Definition at line 264 of file test_routing.cpp.
◆ TEST_F() [9/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| possiblePathsWithAreaFromUnconnectedLanelet | |||
| ) |
Definition at line 272 of file test_routing.cpp.
◆ TEST_F() [10/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| reachableSetCrossingWithArea | |||
| ) |
Definition at line 240 of file test_routing.cpp.
◆ TEST_F() [11/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| reachableSetStartingFromArea | |||
| ) |
Definition at line 250 of file test_routing.cpp.
◆ TEST_F() [12/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| reachableSetWithAreaFromTwoWayLanelet | |||
| ) |
Definition at line 254 of file test_routing.cpp.
◆ TEST_F() [13/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| reachableSetWithAreaFromUnconnectedLanelet | |||
| ) |
Definition at line 259 of file test_routing.cpp.
◆ TEST_F() [14/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| shortestPathIncludingAreasFromArea | |||
| ) |
Definition at line 464 of file test_routing.cpp.
◆ TEST_F() [15/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| shortestPathIncludingAreasThroughAreas | |||
| ) |
Definition at line 471 of file test_routing.cpp.
◆ TEST_F() [16/40]
| TEST_F | ( | GermanPedestrianGraph | , |
| shortestPathIncludingAreasViaThroughAreas | |||
| ) |
Definition at line 478 of file test_routing.cpp.
◆ TEST_F() [17/40]
| TEST_F | ( | GermanVehicleGraph | , |
| forEachPredecessorIncludingAreasReachesLanelet | |||
| ) |
Definition at line 442 of file test_routing.cpp.
◆ TEST_F() [18/40]
| TEST_F | ( | GermanVehicleGraph | , |
| forEachPredecessorReachesLanelet | |||
| ) |
Definition at line 453 of file test_routing.cpp.
◆ TEST_F() [19/40]
| TEST_F | ( | GermanVehicleGraph | , |
| forEachSuccessorIsMonotonic | |||
| ) |
Definition at line 402 of file test_routing.cpp.
◆ TEST_F() [20/40]
| TEST_F | ( | GermanVehicleGraph | , |
| GetShortestPath | |||
| ) |
Definition at line 82 of file test_routing.cpp.
◆ TEST_F() [21/40]
| TEST_F | ( | GermanVehicleGraph | , |
| GetShortestPathInvalid | |||
| ) |
Definition at line 142 of file test_routing.cpp.
◆ TEST_F() [22/40]
| TEST_F | ( | GermanVehicleGraph | , |
| GetShortestPathMaxHose | |||
| ) |
Definition at line 123 of file test_routing.cpp.
◆ TEST_F() [23/40]
| TEST_F | ( | GermanVehicleGraph | , |
| GetShortestPathVia1 | |||
| ) |
Definition at line 150 of file test_routing.cpp.
◆ TEST_F() [24/40]
| TEST_F | ( | GermanVehicleGraph | , |
| GetShortestPathVia2 | |||
| ) |
Definition at line 176 of file test_routing.cpp.
◆ TEST_F() [25/40]
| TEST_F | ( | GermanVehicleGraph | , |
| GetShortestPathViaInvalid | |||
| ) |
Definition at line 195 of file test_routing.cpp.
◆ TEST_F() [26/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsIncludeShorterAllLimitsLc | |||
| ) |
Definition at line 302 of file test_routing.cpp.
◆ TEST_F() [27/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsIncludeShorterAllLimitsNoLc | |||
| ) |
Definition at line 320 of file test_routing.cpp.
◆ TEST_F() [28/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsIncludeShorterLc | |||
| ) |
Definition at line 293 of file test_routing.cpp.
◆ TEST_F() [29/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsIncludeShorterNoLc | |||
| ) |
Definition at line 311 of file test_routing.cpp.
◆ TEST_F() [30/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsInvalid | |||
| ) |
Definition at line 365 of file test_routing.cpp.
◆ TEST_F() [31/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsLimitLengthNoLc | |||
| ) |
Definition at line 329 of file test_routing.cpp.
◆ TEST_F() [32/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsMaxHose | |||
| ) |
Definition at line 337 of file test_routing.cpp.
◆ TEST_F() [33/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsMinLanelets | |||
| ) |
Definition at line 346 of file test_routing.cpp.
◆ TEST_F() [34/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsMinRoutingCosts | |||
| ) |
Definition at line 280 of file test_routing.cpp.
◆ TEST_F() [35/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsTowardsMinLanelets | |||
| ) |
Definition at line 395 of file test_routing.cpp.
◆ TEST_F() [36/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsTowardsWithLc | |||
| ) |
Definition at line 388 of file test_routing.cpp.
◆ TEST_F() [37/40]
| TEST_F | ( | GermanVehicleGraph | , |
| possiblePathsTowardsWithoutLc | |||
| ) |
Definition at line 381 of file test_routing.cpp.
◆ TEST_F() [38/40]
| TEST_F | ( | GermanVehicleGraph | , |
| reachableSet | |||
| ) |
Definition at line 208 of file test_routing.cpp.
◆ TEST_F() [39/40]
| TEST_F | ( | GermanVehicleGraph | , |
| reachableSetInvalid | |||
| ) |
Definition at line 233 of file test_routing.cpp.
◆ TEST_F() [40/40]
| TEST_F | ( | GermanVehicleGraph | , |
| reachableSetMaxHose | |||
| ) |
Definition at line 225 of file test_routing.cpp.