|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Node info for SSP algorithm. More...
#include <tpl_mincost.H>
Public Member Functions | |
| void | reset () |
Public Attributes | |
| Flow_Type | potential {0} |
| Node potential for reduced costs. | |
| Flow_Type | distance {0} |
| Shortest path distance. | |
| bool | in_tree {false} |
| Is node in shortest path tree? | |
| void * | parent_arc {nullptr} |
| Parent arc in shortest path tree. | |
| void * | parent_node {nullptr} |
| Parent node. | |
| bool | forward {true} |
| Direction of parent arc. | |
Node info for SSP algorithm.
Stores potential (dual variable) and shortest path information.
Definition at line 94 of file tpl_mincost.H.
|
inline |
Definition at line 103 of file tpl_mincost.H.
References Aleph::SSP_Node_Info< Flow_Type >::distance, Aleph::SSP_Node_Info< Flow_Type >::in_tree, Aleph::SSP_Node_Info< Flow_Type >::parent_arc, and Aleph::SSP_Node_Info< Flow_Type >::parent_node.
| Flow_Type Aleph::SSP_Node_Info< Flow_Type >::distance {0} |
Shortest path distance.
Definition at line 97 of file tpl_mincost.H.
Referenced by Aleph::SSP_Node_Info< Flow_Type >::reset().
Direction of parent arc.
Definition at line 101 of file tpl_mincost.H.
Is node in shortest path tree?
Definition at line 98 of file tpl_mincost.H.
Referenced by Aleph::SSP_Node_Info< Flow_Type >::reset().
Parent arc in shortest path tree.
Definition at line 99 of file tpl_mincost.H.
Referenced by Aleph::SSP_Node_Info< Flow_Type >::reset().
Parent node.
Definition at line 100 of file tpl_mincost.H.
Referenced by Aleph::SSP_Node_Info< Flow_Type >::reset().
| Flow_Type Aleph::SSP_Node_Info< Flow_Type >::potential {0} |
Node potential for reduced costs.
Definition at line 96 of file tpl_mincost.H.