![]() |
CMR
1.3.0
|
Node information for shortest-path computation in CMRcomputeRepresentationMatrix(). More...
Public Attributes | |
| DIJKSTRA_STAGE | stage |
| At which stage of the algorithm is this node? | |
| int | predecessor |
| Predecessor node in shortest-path branching, or -1 for a root. | |
| CMR_GRAPH_EDGE | rootEdge |
| The actual edge towards the predecessor, or -1 for a root./. | |
| bool | reversed |
| Whether the edge towards the predecessor is reversed. | |
Node information for shortest-path computation in CMRcomputeRepresentationMatrix().
| int DijkstraNodeData::predecessor |
Predecessor node in shortest-path branching, or -1 for a root.
| bool DijkstraNodeData::reversed |
Whether the edge towards the predecessor is reversed.
| CMR_GRAPH_EDGE DijkstraNodeData::rootEdge |
The actual edge towards the predecessor, or -1 for a root./.
| DIJKSTRA_STAGE DijkstraNodeData::stage |
At which stage of the algorithm is this node?