| ▼Nlanelet | |
| ▼Nrouting | |
| ▼Ninternal | |
| CConflictingSectionFilter | Finds vertices that are in conflict or adjacent to some vertices (not reachable though bidirectional lane changes) |
| ▼CConnectedPathIterator | An iterator that finds paths from a start vertex to all reachable destinations |
| CPathVisitor | |
| CDijkstraCostMap | |
| ▼CDijkstraStyleSearch | |
| CDijkstraStyleVisitor | |
| CLeafFilter | |
| CEdgeCostFilter | An internal edge filter to get a filtered view on the graph |
| CEdgeInfo | Internal information of an edge in the graph |
| CEdgeRelationFilter | |
| CEdgeWriterGraphViz | Internal edge writer for graphViz file export. Includes label, color and if existent routing cost (as 'weight') and the routing cost module ID |
| CGetEdges | |
| CGetEdges< false > | |
| CGetEdges< true > | |
| CGetTarget | |
| CGetTarget< false > | |
| CGetTarget< true > | |
| CGraph | Manages the actual routing graph and provieds different views on the edges (lazily computed) |
| ▼CLaneChangeLaneletsCollector | This class collects lane changable lanelets and combines them to a sequence of adjacent lanechangable lanelets |
| CLaneChangeInfo | |
| CNextToRouteFilter | Removes vertices from the graph that are not adjacent to a set of vertices. Adjacent can also mean conflicting! |
| CNoConflictingFilter | Removes conflicting edges from the graph |
| COnlyDrivableEdgesWithinFilter | Removes edges from the graph that are not drivable (e.g. adjacent or conflicing) OR leave the route at its end |
| COnRouteAndConflictFilter | Finds vertices within a set of vertices that are in conflict with another set of vertices |
| COnRouteFilter | Reduces the graph to a set of desired vertices |
| COriginalGraphFilter | Filter that reduces the original graph by edges that belong to different cost types or lane changes |
| CRouteBuilder | Builder class to create a route from a routing graph and the shortest path |
| CRouteGraph | |
| CRouteVertexInfo | Internal information of a vertex in the route graph |
| CRoutingGraphBuilder | |
| CRoutingGraphGraph | |
| CSparseColorMap | For graph queries, we implement our own color map because boost's color does not perform well on sparse graphs |
| CVertexInfo | Internal information of a vertex in the graph If A* search is adapted, this could hold information about longitude and latitude |
| CVertexState | |
| CVertexVisitInformation | This object carries the required information for the graph neighbourhood search |
| CVertexWriterGraphViz | Internal vertex writer for graphViz file export |
| ▼Ntests | |
| CAllGraphsTest | |
| CGermanBicycleGraph | |
| CGermanPedestrianGraph | |
| CGermanVehicleGraph | |
| CRoutingGraphTest | |
| CRoutingGraphTestData | |
| CDebugMapBuilder | |
| CLaneletOrAreaPath | Similar to LaneletPath, but can also contain areas |
| CLaneletOrAreaVisitInformation | This object carries the required information for the graph neighbourhood search |
| CLaneletPath | A lanelet path represents a set of lanelets that can be reached in order by either driving straight or doing lane changes |
| CLaneletRelation | Represents the relation of a lanelet to another lanelet |
| CLaneletVisitInformation | This object carries the required information for the graph neighbourhood search |
| CPossiblePathsParams | Controls the behaviour of the different possible path algorithms in RoutingGraph |
| CRoute | The famous route object that marks a route from A to B |
| CRoutingCost | Abstract class to define a framework for custom routing cost calculation modules. This interfaces can be implemented to allow routing cost calculation based on specific needs (e.g. road conditions). As of now, two modules are implemented which should satisfy basic needs: |
| CRoutingCostDistance | A basic distance-based routing cost module. Uses the 2D length and a fixed lane change cost to evaluate relations |
| CRoutingCostTravelTime | A basic travel time-based routing cost module. Uses maximum allowed speed or the maximum speed of the participant (what every is lower) and a fixed lane chance cost |
| CRoutingGraph | Main class of the routing module that holds routing information and can be queried. The RoutingGraph class is the central object of this module and is initialized with a LaneletMap, TrafficRules and RoutingCost. A routing graph with all interesting relations will be created for the traffic participant featured in the provided TrafficRules module. Routing costs will be calculated for each provided module. The routing graph can answer queries like "left", "following", "conflicting" lanelets, but also provide a shortest route or a Route |
| CRoutingGraphContainer | Container to associate multiple routing graphs to allow queries on multiple graphs |
| CExportError | Thrown when an export to the provided file(name) cannot be done |
| CRoutingGraphError | Thrown when an there's an error in the routing graph. It will feature further information |
| CAllRoutesTest | |
| CConfigurationInitialization | |
| CLaneletOrAreaTest | |
| CRoute1 | |
| CRoute1NoLc | |
| CRoute2 | |
| CRoute3 | |
| CRoute4 | |
| CRoute5 | |
| CRouteCircular | |
| CRouteCircularNoLc | |
| CRouteInCircle | |
| CRouteMaxHoseLeftRight | |
| CRouteMaxHoseLeftRightDashedSolid | |
| CRouteMaxHoseLeftRightDashedSolidFurther | |
| CRouteMaxHoseRightLeft | |
| CRouteMissingLanelet | |
| CRouteRoutingGraphContainerTest | |
| CRouteSolidDashed | |
| CRouteSolidDashedWithAdjacent | |
| CRouteSplittedDiverging | |
| CRouteSplittedDivergingAndMerging | |
| CRouteViaSimple | |
| CRoutingGraphContainerTest | |
| CTempfile | |
| CTestRoute | |