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 22 of file Types.h.
◆ cost
double lanelet::routing::LaneletVisitInformation::cost {} |
The accumulated cost from the start along shortest path.
Definition at line 25 of file Types.h.
◆ lanelet
ConstLanelet lanelet::routing::LaneletVisitInformation::lanelet |
The lanelet or area that is currently visited.
Definition at line 23 of file Types.h.
◆ length
size_t lanelet::routing::LaneletVisitInformation::length {} |
The number of lanelets from start to here along shortest path (including this)
Definition at line 26 of file Types.h.
◆ numLaneChanges
size_t lanelet::routing::LaneletVisitInformation::numLaneChanges {} |
Number of lane changes from start to here along shortest path.
Definition at line 27 of file Types.h.
◆ predecessor
ConstLanelet lanelet::routing::LaneletVisitInformation::predecessor |
Its predecessor on the shortest path.
Definition at line 24 of file Types.h.
The documentation for this struct was generated from the following file: