Classes | Namespaces | Typedefs
Graph.h File Reference
#include <lanelet2_core/primitives/LaneletOrArea.h>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <map>
#include <utility>
#include "lanelet2_routing/Exceptions.h"
#include "lanelet2_routing/Forward.h"
Include dependency graph for Graph.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  lanelet::routing::internal::EdgeCostFilter< GraphT >
 An internal edge filter to get a filtered view on the graph. More...
 
struct  lanelet::routing::internal::EdgeCostFilter< GraphT >
 An internal edge filter to get a filtered view on the graph. More...
 
struct  lanelet::routing::internal::EdgeInfo
 Internal information of an edge in the graph. More...
 
class  lanelet::routing::internal::Graph< BaseGraphT >
 Manages the actual routing graph and provieds different views on the edges (lazily computed) More...
 
class  lanelet::routing::internal::RouteGraph
 
struct  lanelet::routing::internal::RouteVertexInfo
 Internal information of a vertex in the route graph. More...
 
class  lanelet::routing::internal::RoutingGraphGraph
 
struct  lanelet::routing::internal::VertexInfo
 Internal information of a vertex in the graph If A* search is adapted, this could hold information about longitude and latitude. More...
 

Namespaces

 lanelet
 
 lanelet::routing
 
 lanelet::routing::internal
 

Typedefs

using lanelet::routing::internal::FilteredGraphDesc = std::pair< size_t, RelationType >
 
template<typename BaseGraphT >
using lanelet::routing::internal::FilteredGraphT = boost::filtered_graph< BaseGraphT, EdgeCostFilter< BaseGraphT > >
 
template<typename BaseGraphT >
using lanelet::routing::internal::FilteredGraphTraits = boost::graph_traits< FilteredGraphT< BaseGraphT > >
 
using lanelet::routing::internal::FilteredRouteGraph = FilteredGraphT< RouteGraphType >
 
using lanelet::routing::internal::FilteredRoutingGraph = FilteredGraphT< GraphType >
 
using lanelet::routing::internal::GraphTraits = boost::graph_traits< GraphType >
 
using lanelet::routing::internal::GraphType = boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, VertexInfo, EdgeInfo >
 General graph type definitions. More...
 
using lanelet::routing::internal::LaneletOrAreaToVertex = std::unordered_map< ConstLaneletOrArea, std::uint32_t >
 
using lanelet::routing::internal::RouteGraphType = boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, RouteVertexInfo, EdgeInfo >
 


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