This object carries the required information for the graph neighbourhood search.
More...
#include <Types.h>
This object carries the required information for the graph neighbourhood search.
Definition at line 13 of file Types.h.
◆ cost
double lanelet::routing::LaneletOrAreaVisitInformation::cost {} |
The accumulated cost from the start along shortest path.
Definition at line 16 of file Types.h.
◆ laneletOrArea
The lanelet or area that is currently visited.
Definition at line 14 of file Types.h.
◆ length
size_t lanelet::routing::LaneletOrAreaVisitInformation::length {} |
Number of elements from start to here along shortest path (including this)
Definition at line 17 of file Types.h.
◆ numLaneChanges
size_t lanelet::routing::LaneletOrAreaVisitInformation::numLaneChanges {} |
Number of lane changes from start to here along shortest path.
Definition at line 18 of file Types.h.
◆ predecessor
Its predecessor on the shortest path.
Definition at line 15 of file Types.h.
The documentation for this struct was generated from the following file: