Internal information of an edge in the graph.
More...
#include <Graph.h>
Internal information of an edge in the graph.
Definition at line 36 of file Graph.h.
◆ costId
ID of the routing cost module that was used to calculate cost.
Definition at line 38 of file Graph.h.
◆ relation
Relation between the two lanelets. E.g. SUCCESSOR or CONFLICTING.
Definition at line 39 of file Graph.h.
◆ routingCost
double lanelet::routing::internal::EdgeInfo::routingCost |
Calculcated routing cost. Infinity if not routable.
Definition at line 37 of file Graph.h.
The documentation for this struct was generated from the following file: