#include <ShortestPath.h>
Public Attributes | |
| double | cost {} |
| Current accumulated cost. More... | |
| bool | isLeaf {true} |
| True if it has no successor that is on the shortest path. More... | |
| size_t | length {} |
| Number of vertices to this vertex (including this one) More... | |
| size_t | numLaneChanges {} |
| Required lane changes along the shortest path in order to get here. More... | |
| RoutingGraphGraph::Vertex | predecessor {} |
| The vertex this refers to. More... | |
| bool | predicate {true} |
| False if disabled by predicate. More... | |
Definition at line 23 of file ShortestPath.h.
| double lanelet::routing::internal::VertexState::cost {} |
Current accumulated cost.
Definition at line 25 of file ShortestPath.h.
| bool lanelet::routing::internal::VertexState::isLeaf {true} |
True if it has no successor that is on the shortest path.
Definition at line 29 of file ShortestPath.h.
| size_t lanelet::routing::internal::VertexState::length {} |
Number of vertices to this vertex (including this one)
Definition at line 26 of file ShortestPath.h.
| size_t lanelet::routing::internal::VertexState::numLaneChanges {} |
Required lane changes along the shortest path in order to get here.
Definition at line 27 of file ShortestPath.h.
| RoutingGraphGraph::Vertex lanelet::routing::internal::VertexState::predecessor {} |
The vertex this refers to.
Definition at line 24 of file ShortestPath.h.
| bool lanelet::routing::internal::VertexState::predicate {true} |
False if disabled by predicate.
Definition at line 28 of file ShortestPath.h.