Edge data structure of the graph maintained by a planner algorithm. More...
#include <vertex_edge.h>
Public Attributes | |
edge_data_t | data |
The data that is stored in this vertex. | |
trajectory_t * | trajectory_edge |
A pointer to the state stored in this vertex. | |
vertex_t * | vertex_src |
A pointer to the source vertex. | |
vertex_t * | vertex_dst |
A pointer to the destination vertex. |
Edge data structure of the graph maintained by a planner algorithm.
The data that is stored in this vertex.
The data that is stored in every vertex of the graph. The type for the data is given as a template argument
trajectory_t* smp::edge< typeparams >::trajectory_edge |
A pointer to the state stored in this vertex.
The trajectory along this edge. The types for the state and the input for this trajectory are taken as template arguments.
vertex_t* smp::edge< typeparams >::vertex_dst |
A pointer to the destination vertex.
The destination vertex that this edge ends at.
vertex_t* smp::edge< typeparams >::vertex_src |
A pointer to the source vertex.
The source vertex that this edge starts from.