|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Node information for Network Simplex algorithm. More...
#include <tpl_netcost.H>
Public Attributes | |
| Ftype | potential = 0 |
| Node potential (dual variable pi). | |
| void * | parent = nullptr |
| Parent node in the spanning tree (nullptr for root). | |
| void * | parent_arc = nullptr |
| Arc connecting this node to its parent. | |
| long | depth = 0 |
| Depth in the spanning tree (root has depth 0). | |
| bool | arc_from_parent = true |
| True if parent_arc is oriented from parent towards this node. | |
| long | mark = 0 |
| Mark used for LCA computation. | |
Node information for Network Simplex algorithm.
Stores tree structure and dual variables (potentials) for each node. The tree is represented with parent pointers and a mark for efficient tree membership testing.
| Ftype | Flow/cost numeric type. |
Definition at line 913 of file tpl_netcost.H.
True if parent_arc is oriented from parent towards this node.
Definition at line 928 of file tpl_netcost.H.
Referenced by Aleph::Network_Simplex< Net >::augment_and_find_leaving().
| long Aleph::Simplex_Node_Info< Ftype >::depth = 0 |
Depth in the spanning tree (root has depth 0).
Definition at line 925 of file tpl_netcost.H.
Referenced by Aleph::Network_Simplex< Net >::build_spanning_tree(), and Aleph::Network_Simplex< Net >::depth().
| long Aleph::Simplex_Node_Info< Ftype >::mark = 0 |
Mark used for LCA computation.
Definition at line 931 of file tpl_netcost.H.
Referenced by Aleph::Network_Simplex< Net >::find_lca().
Parent node in the spanning tree (nullptr for root).
Definition at line 919 of file tpl_netcost.H.
Referenced by Aleph::Network_Simplex< Net >::parent().
Arc connecting this node to its parent.
Definition at line 922 of file tpl_netcost.H.
Referenced by Aleph::Network_Simplex< Net >::parent_arc().
| Ftype Aleph::Simplex_Node_Info< Ftype >::potential = 0 |
Node potential (dual variable pi).
Definition at line 916 of file tpl_netcost.H.
Referenced by Aleph::Network_Simplex< Net >::build_spanning_tree(), Aleph::Network_Simplex< Net >::potential(), and Aleph::Network_Simplex< Net >::reduced_cost().