Template Class ConnectedPathIterator

Defined in File GraphUtils.h

Nested Relationships

Nested Types

Template Class ConnectedPathIterator::PathVisitor

Class Documentation

template<typename GraphT> class ConnectedPathIterator

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

Public Types

using Vertices = std::vector<LaneletVertexId>

Public Functions

ConnectedPathIterator() = default

inline explicit ConnectedPathIterator(const GraphT &g)

template<typename Func> inline void forEachPath(LaneletVertexId start, Func &&f): 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.

inline bool hasPathFromTo(LaneletVertexId from, LaneletVertexId to): Returns whether a path exists in the graph that connects from and to.

inline GraphT &graph()