Private Member Functions | List of all members
lanelet::routing::internal::RouteGraph Class Reference

#include <Graph.h>

Inheritance diagram for lanelet::routing::internal::RouteGraph:
Inheritance graph
[legend]

Private Member Functions

 Graph (size_t numRoutingCosts)
 

Additional Inherited Members

- Public Types inherited from lanelet::routing::internal::Graph< RouteGraphType >
using CostFilter = EdgeCostFilter< RouteGraphType >
 
using Edge = typename boost::graph_traits< RouteGraphType >::edge_descriptor
 
using FilteredGraph = FilteredGraphT< RouteGraphType >
 
using Vertex = typename boost::graph_traits< RouteGraphType >::vertex_descriptor
 
- Public Member Functions inherited from lanelet::routing::internal::Graph< RouteGraphType >
void addEdge (const ConstLaneletOrArea &from, const ConstLaneletOrArea &to, const EdgeInfo &edgeInfo)
 
void addEdge (Vertex from, Vertex to, const EdgeInfo &edgeInfo)
 
Vertex addVertex (const typename RouteGraphType ::vertex_property_type &property)
 add new lanelet to graph More...
 
FilteredGraph adjacentLeft (RoutingCostId routingCostId=0) const
 
FilteredGraph adjacentRight (RoutingCostId routingCostId=0) const
 
FilteredGraph conflicting (RoutingCostId routingCostId=0) const
 
bool empty () const noexcept
 
const RouteGraphTypeget () const noexcept
 
RouteGraphTypeget () noexcept
 
Optional< EdgeInfogetEdgeInfo (const ConstLanelet &from, const ConstLanelet &to) const noexcept
 Received the edgeInfo between two given vertices. More...
 
Optional< EdgeInfogetEdgeInfoFor (const ConstLanelet &from, const ConstLanelet &to, const Graph &g) const noexcept
 Received the edgeInfo between two given vertices and a given (filtered)graph. More...
 
Optional< typename boost::graph_traits< RouteGraphType >::vertex_descriptor > getVertex (const ConstLaneletOrArea &lanelet) const noexcept
 Helper function to determine the graph vertex of a given lanelet. More...
 
 Graph (size_t numRoutingCosts)
 
FilteredGraph left (RoutingCostId routingCostId=0) const
 
size_t numRoutingCosts () const noexcept
 
FilteredGraph right (RoutingCostId routingCostId=0) const
 
FilteredGraph somehowLeft (RoutingCostId routingCostId=0) const
 
FilteredGraph somehowRight (RoutingCostId routingCostId=0) const
 
const LaneletOrAreaToVertexvertexLookup () const noexcept
 
FilteredGraph withAreasAndLaneChanges (RoutingCostId routingCostId=0) const
 
FilteredGraph withAreasWithoutLaneChanges (RoutingCostId routingCostId=0) const
 
FilteredGraph withLaneChanges (RoutingCostId routingCostId=0) const
 
FilteredGraph withoutConflicting (RoutingCostId routingCostId=0) const
 
FilteredGraph withoutLaneChanges (RoutingCostId routingCostId=0) const
 

Detailed Description

Definition at line 248 of file Graph.h.

Member Function Documentation

◆ Graph()

lanelet::routing::internal::Graph< BaseGraphT >::Graph
inlineexplicitprivate

Definition at line 114 of file Graph.h.


The documentation for this class was generated from the following file:


lanelet2_routing
Author(s): Matthias Mayr
autogenerated on Sun Oct 27 2024 02:27:49