Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
can_max_flow Concept Reference

Concept definition

template<class N>
concept can_max_flow = requires(N & net) { dinic_maximum_flow(net); }
#define N
Definition fib.C:294
Net::Flow_Type dinic_maximum_flow(Net &net)
Compute maximum flow using Dinic's algorithm.

Detailed Description

Definition at line 83 of file ah_graph_concepts_test.cc.