|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Result of minimum mean cycle computation. More...
#include <Min_Mean_Cycle.H>
Public Attributes | |
| bool | has_cycle = false |
| True if at least one directed cycle exists. | |
| long double | minimum_mean = std::numeric_limits<long double>::infinity() |
| GT::Node * | witness_node = nullptr |
| Vertex used in Karp witness extraction. | |
| Cost_Type | cycle_total_cost = Cost_Type{0} |
| Weight sum of witness cycle. | |
| size_t | cycle_length = 0 |
| Number of arcs in witness cycle. | |
| DynList< typename GT::Node * > | cycle_nodes |
| Closed witness walk (first node repeated at end). | |
| DynList< typename GT::Arc * > | cycle_arcs |
Witness arcs aligned with cycle_nodes. | |
Result of minimum mean cycle computation.
| GT | Graph type. |
| Cost_Type | Arc weight type returned by the distance accessor. |
Definition at line 87 of file Min_Mean_Cycle.H.
Witness arcs aligned with cycle_nodes.
Definition at line 97 of file Min_Mean_Cycle.H.
| size_t Aleph::Min_Mean_Cycle_Result< GT, Cost_Type >::cycle_length = 0 |
Number of arcs in witness cycle.
Definition at line 94 of file Min_Mean_Cycle.H.
Closed witness walk (first node repeated at end).
Definition at line 96 of file Min_Mean_Cycle.H.
| Cost_Type Aleph::Min_Mean_Cycle_Result< GT, Cost_Type >::cycle_total_cost = Cost_Type{0} |
Weight sum of witness cycle.
Definition at line 93 of file Min_Mean_Cycle.H.
| bool Aleph::Min_Mean_Cycle_Result< GT, Cost_Type >::has_cycle = false |
True if at least one directed cycle exists.
Definition at line 89 of file Min_Mean_Cycle.H.
| long double Aleph::Min_Mean_Cycle_Result< GT, Cost_Type >::minimum_mean = std::numeric_limits<long double>::infinity() |
Definition at line 90 of file Min_Mean_Cycle.H.
| GT::Node* Aleph::Min_Mean_Cycle_Result< GT, Cost_Type >::witness_node = nullptr |
Vertex used in Karp witness extraction.
Definition at line 91 of file Min_Mean_Cycle.H.