![]() |
Parasol Planning Library (PPL)
|
The output of an SSSP run. More...
#include <SSSP.h>

Public Types | |
| typedef GraphType::vertex_descriptor | VD |
| typedef std::unordered_map< VD, double > | DistanceMap |
| typedef std::vector< VD > | Ordering |
| typedef SSSPAdjacencyMap< GraphType > | Adjacency |
| typedef std::unordered_map< VD, VD > | ParentMap |
Data Fields | |
| DistanceMap | distance |
| Distance to each cell from start. More... | |
| Ordering | ordering |
| Cell discovery ordering. More... | |
| Adjacency | successors |
| Maps predecessor -> successors. More... | |
| ParentMap | parent |
| Maps successor -> parent. More... | |
The output of an SSSP run.
| typedef SSSPAdjacencyMap<GraphType> SSSPOutput< GraphType >::Adjacency |
| typedef std::unordered_map<VD, double> SSSPOutput< GraphType >::DistanceMap |
| typedef std::vector<VD> SSSPOutput< GraphType >::Ordering |
| typedef std::unordered_map<VD, VD> SSSPOutput< GraphType >::ParentMap |
| typedef GraphType::vertex_descriptor SSSPOutput< GraphType >::VD |
| DistanceMap SSSPOutput< GraphType >::distance |
Distance to each cell from start.
| Ordering SSSPOutput< GraphType >::ordering |
Cell discovery ordering.
| ParentMap SSSPOutput< GraphType >::parent |
Maps successor -> parent.
| Adjacency SSSPOutput< GraphType >::successors |
Maps predecessor -> successors.