Aleph::Simplex_Arc_Info< Ftype > Struct Template Reference

Arc information for Network Simplex algorithm. More...

#include <tpl_netcost.H>

Public Attributes
Simplex_Arc_State	state = Simplex_Arc_State::Lower
	Arc state (Lower, Upper, or Tree).
bool	skip = false
	Skip this arc temporarily (failed pivot, will retry later).
Ftype	lower_bound = Ftype{0}
	Lower bound on flow (default 0).

Detailed Description

template<typename Ftype>
struct Aleph::Simplex_Arc_Info< Ftype >

Arc information for Network Simplex algorithm.

Template Parameters

Ftype

Flow/cost numeric type.

Definition at line 954 of file tpl_netcost.H.

Member Data Documentation

lower_bound

template<typename Ftype >

Ftype Aleph::Simplex_Arc_Info< Ftype >::lower_bound = Ftype{0}

Lower bound on flow (default 0).

Definition at line 961 of file tpl_netcost.H.

Referenced by Aleph::Network_Simplex< Net >::get_lower_bound(), Aleph::Network_Simplex< Net >::residual_lower(), and Aleph::Network_Simplex< Net >::set_lower_bound().

skip

template<typename Ftype >

bool Aleph::Simplex_Arc_Info< Ftype >::skip = false

Skip this arc temporarily (failed pivot, will retry later).

Definition at line 959 of file tpl_netcost.H.

Referenced by Aleph::Network_Simplex< Net >::run().

state

template<typename Ftype >

Simplex_Arc_State Aleph::Simplex_Arc_Info< Ftype >::state = Simplex_Arc_State::Lower

Arc state (Lower, Upper, or Tree).

Definition at line 957 of file tpl_netcost.H.

Referenced by Aleph::Network_Simplex< Net >::augment_and_find_leaving(), Aleph::Network_Simplex< Net >::build_spanning_tree(), Aleph::Network_Simplex< Net >::find_entering_arc(), Aleph::Network_Simplex< Net >::force_partial_arcs_into_tree(), Aleph::Network_Simplex< Net >::init_structures(), Aleph::Network_Simplex< Net >::pivot_tree(), Aleph::Network_Simplex< Net >::print_diagnostics(), and Aleph::Network_Simplex< Net >::run().

---

The documentation for this struct was generated from the following file:

• tpl_netcost.H