|
discrete-modulus (C++)
Reference implementations of discrete modulus algorithms (C++)
|
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< FlowEdge > | forward |
| indexed by edge_index: source(e,g) -> target(e,g) | |
| std::vector< FlowEdge > | backward |
| indexed by edge_index: target(e,g) -> source(e,g) | |
| std::vector< FlowEdge > | to_target |
| indexed by vertex: v -> target | |
| std::vector< FlowEdge > | from_source |
| indexed by vertex: source -> v | |
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).
| std::vector<FlowEdge> discrete_modulus::FlowContext::backward |
indexed by edge_index: target(e,g) -> source(e,g)
| std::vector<FlowEdge> discrete_modulus::FlowContext::forward |
indexed by edge_index: source(e,g) -> target(e,g)
| std::vector<FlowEdge> discrete_modulus::FlowContext::from_source |
indexed by vertex: source -> v
| FlowGraph discrete_modulus::FlowContext::graph |
| FlowVertex discrete_modulus::FlowContext::src {} |
| FlowVertex discrete_modulus::FlowContext::tgt {} |
| std::vector<FlowEdge> discrete_modulus::FlowContext::to_target |
indexed by vertex: v -> target