lanelet::routing::internal::DijkstraStyleSearch< G > Class Template Reference

#include <ShortestPath.h>

Classes
class	DijkstraStyleVisitor
class	LeafFilter

Public Types
using	DijkstraSearchMapType = DijkstraSearchMap< VertexType >
using	EdgeType = typename boost::graph_traits< G >::edge_descriptor
using	VertexType = typename boost::graph_traits< G >::vertex_descriptor
using	VisitCallback = std::function< bool(const VertexVisitInformation &)>

Public Member Functions
	DijkstraStyleSearch (const G &graph)
	Constructor for the graph search. More...
const DijkstraSearchMapType &	getMap () const
	Returns the result. More...
template<typename Func >
void	query (VertexType start, Func &&func)

Private Types
using	SearchGraph = boost::filtered_graph< G, LeafFilter >

Private Attributes
SearchGraph	graph_
DijkstraSearchMapType	vertices_

Detailed Description

template<typename G>
class lanelet::routing::internal::DijkstraStyleSearch< G >

Definition at line 59 of file ShortestPath.h.

Member Typedef Documentation

DijkstraSearchMapType

template<typename G >

using lanelet::routing::internal::DijkstraStyleSearch< G >::DijkstraSearchMapType = DijkstraSearchMap<VertexType>

Definition at line 63 of file ShortestPath.h.

EdgeType

template<typename G >

using lanelet::routing::internal::DijkstraStyleSearch< G >::EdgeType = typename boost::graph_traits<G>::edge_descriptor

Definition at line 62 of file ShortestPath.h.

SearchGraph

template<typename G >

using lanelet::routing::internal::DijkstraStyleSearch< G >::SearchGraph = boost::filtered_graph<G, LeafFilter>

private

Definition at line 77 of file ShortestPath.h.

VertexType

template<typename G >

using lanelet::routing::internal::DijkstraStyleSearch< G >::VertexType = typename boost::graph_traits<G>::vertex_descriptor

Definition at line 61 of file ShortestPath.h.

VisitCallback

template<typename G >

using lanelet::routing::internal::DijkstraStyleSearch< G >::VisitCallback = std::function<bool(const VertexVisitInformation&)>

Definition at line 64 of file ShortestPath.h.

Constructor & Destructor Documentation

DijkstraStyleSearch()

template<typename G >

lanelet::routing::internal::DijkstraStyleSearch< G >::DijkstraStyleSearch ( const G &  graph )

inlineexplicit

Constructor for the graph search.

Definition at line 112 of file ShortestPath.h.

Member Function Documentation

getMap()

template<typename G >

const DijkstraSearchMapType& lanelet::routing::internal::DijkstraStyleSearch< G >::getMap ( ) const

inline

Returns the result.

Definition at line 130 of file ShortestPath.h.

query()

template<typename G >

template<typename Func >

void lanelet::routing::internal::DijkstraStyleSearch< G >::query ( VertexType  start, Func &&  func  )

inline

Performs the dijkstra style search by calling func whenever the shortest path for a certain vertex is discovered. Whenever func returns false, the successor edges of this vertex will not be visited.

Definition at line 117 of file ShortestPath.h.

Member Data Documentation

graph_

template<typename G >

SearchGraph lanelet::routing::internal::DijkstraStyleSearch< G >::graph_

private

Definition at line 133 of file ShortestPath.h.

vertices_

template<typename G >

DijkstraSearchMapType lanelet::routing::internal::DijkstraStyleSearch< G >::vertices_

private

Definition at line 134 of file ShortestPath.h.

---

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

• ShortestPath.h