lanelet::routing::internal::ConnectedPathIterator< GraphT > Class Template Reference

An iterator that finds paths from a start vertex to all reachable destinations. More...

#include <GraphUtils.h>

Classes
class	PathVisitor

Public Types
using	Vertices = std::vector< LaneletVertexId >

Public Member Functions
	ConnectedPathIterator ()=default
	ConnectedPathIterator (const GraphT &g)
template<typename Func >
void	forEachPath (LaneletVertexId start, Func &&f)
GraphT &	graph ()
bool	hasPathFromTo (LaneletVertexId from, LaneletVertexId to)
	Returns whether a path exists in the graph that connects from and to. More...

Private Attributes
GraphT	g_
Vertices	path_

Detailed Description

template<typename GraphT>
class lanelet::routing::internal::ConnectedPathIterator< GraphT >

An iterator that finds paths from a start vertex to all reachable destinations.

Definition at line 324 of file GraphUtils.h.

Member Typedef Documentation

Vertices

template<typename GraphT >

using lanelet::routing::internal::ConnectedPathIterator< GraphT >::Vertices = std::vector<LaneletVertexId>

Definition at line 326 of file GraphUtils.h.

Constructor & Destructor Documentation

ConnectedPathIterator() [1/2]

template<typename GraphT >

lanelet::routing::internal::ConnectedPathIterator< GraphT >::ConnectedPathIterator ( )

default

ConnectedPathIterator() [2/2]

template<typename GraphT >

lanelet::routing::internal::ConnectedPathIterator< GraphT >::ConnectedPathIterator ( const GraphT &  g )

inlineexplicit

Definition at line 355 of file GraphUtils.h.

Member Function Documentation

forEachPath()

template<typename GraphT >

template<typename Func >

void lanelet::routing::internal::ConnectedPathIterator< GraphT >::forEachPath ( LaneletVertexId  start, Func &&  f  )

inline

Calls a function for all full paths starting from start. A full path is a path from start to either a leaf or the last unvisited vertex in loops.

Definition at line 360 of file GraphUtils.h.

graph()

template<typename GraphT >

GraphT& lanelet::routing::internal::ConnectedPathIterator< GraphT >::graph ( )

inline

Definition at line 387 of file GraphUtils.h.

hasPathFromTo()

template<typename GraphT >

bool lanelet::routing::internal::ConnectedPathIterator< GraphT >::hasPathFromTo ( LaneletVertexId  from, LaneletVertexId  to  )

inline

Returns whether a path exists in the graph that connects from and to.

Definition at line 369 of file GraphUtils.h.

Member Data Documentation

g_

template<typename GraphT >

GraphT lanelet::routing::internal::ConnectedPathIterator< GraphT >::g_

private

Definition at line 390 of file GraphUtils.h.

path_

template<typename GraphT >

Vertices lanelet::routing::internal::ConnectedPathIterator< GraphT >::path_

private

Definition at line 391 of file GraphUtils.h.

---

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

• GraphUtils.h