pub struct MaxflowStats {
pub pushes: i64,
pub relabels: i64,
pub gaps: i64,
pub gap_nodes: i64,
pub bfs_runs: i64,
}Expand description
Statistics collected by igraph’s push-relabel maximum flow solver
(igraph_maxflow_stats_t).
They are mostly interesting for benchmarking and for understanding how much work the Goldberg–Tarjan algorithm had to do on a given network. For undirected graphs igraph solves the flow problem on a directed graph with every edge doubled, and the statistics refer to that graph.
Fields§
§pushes: i64Number of push operations performed (nopush).
relabels: i64Number of relabel operations performed (norelabel).
gaps: i64Number of times the gap heuristic was applied (nogap).
gap_nodes: i64Total number of vertices removed from further consideration by the
gap heuristic (nogapnodes).
bfs_runs: i64Number of reverse breadth-first searches used to (re)compute the
height function (nobfs); always at least one, as one runs before
the algorithm starts.
Trait Implementations§
Source§impl Clone for MaxflowStats
impl Clone for MaxflowStats
Source§fn clone(&self) -> MaxflowStats
fn clone(&self) -> MaxflowStats
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreimpl Copy for MaxflowStats
Source§impl Debug for MaxflowStats
impl Debug for MaxflowStats
Source§impl Default for MaxflowStats
impl Default for MaxflowStats
Source§fn default() -> MaxflowStats
fn default() -> MaxflowStats
impl Eq for MaxflowStats
Source§impl From<igraph_maxflow_stats_t> for MaxflowStats
impl From<igraph_maxflow_stats_t> for MaxflowStats
Source§fn from(s: igraph_maxflow_stats_t) -> Self
fn from(s: igraph_maxflow_stats_t) -> Self
Source§impl Hash for MaxflowStats
impl Hash for MaxflowStats
Source§impl PartialEq for MaxflowStats
impl PartialEq for MaxflowStats
Source§fn eq(&self, other: &MaxflowStats) -> bool
fn eq(&self, other: &MaxflowStats) -> bool
self and other values to be equal, and is used by ==.