discrete-modulus (C++)
Reference implementations of discrete modulus algorithms (C++)
Loading...
Searching...
No Matches
Public Attributes | List of all members
discrete_modulus::FlowContext Struct Reference

The reusable max-flow network for cunningham_min / graph_vulnerability / spanning_tree_modulus, built once per graph by create_flow_graph. More...

#include <discrete_modulus/cunningham.hpp>

Public Attributes

FlowGraph graph
 
FlowVertex src {}
 
FlowVertex tgt {}
 
std::vector< FlowEdgeforward
 indexed by edge_index: source(e,g) -> target(e,g)
 
std::vector< FlowEdgebackward
 indexed by edge_index: target(e,g) -> source(e,g)
 
std::vector< FlowEdgeto_target
 indexed by vertex: v -> target
 
std::vector< FlowEdgefrom_source
 indexed by vertex: source -> v
 

Detailed Description

The reusable max-flow network for cunningham_min / graph_vulnerability / spanning_tree_modulus, built once per graph by create_flow_graph.

Bundles the flow graph together with handles to the specific edges whose capacities get updated on every call (looked up once here, since FlowGraph has parallel edges between some vertex pairs – see create_flow_graph's implementation comments).

Member Data Documentation

◆ backward

std::vector<FlowEdge> discrete_modulus::FlowContext::backward

indexed by edge_index: target(e,g) -> source(e,g)

◆ forward

std::vector<FlowEdge> discrete_modulus::FlowContext::forward

indexed by edge_index: source(e,g) -> target(e,g)

◆ from_source

std::vector<FlowEdge> discrete_modulus::FlowContext::from_source

indexed by vertex: source -> v

◆ graph

FlowGraph discrete_modulus::FlowContext::graph

◆ src

FlowVertex discrete_modulus::FlowContext::src {}

◆ tgt

FlowVertex discrete_modulus::FlowContext::tgt {}

◆ to_target

std::vector<FlowEdge> discrete_modulus::FlowContext::to_target

indexed by vertex: v -> target


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