d3/d70/conceptAleph_1_1FlowNetwork.html

template<class Net>

concept Aleph::FlowNetwork =

      AlephGraph<Net> and

      requires { typename graph_concepts_detail::graph_t<Net>::Flow_Type; } and

      requires(const graph_concepts_detail::graph_t<Net> & net,

               typename graph_concepts_detail::graph_t<Net>::Arc * a)

        {

          { net.get_source() } -> std::convertible_to<typename graph_concepts_detail::graph_t<Net>::Node *>;

          { net.get_sink() } -> std::convertible_to<typename graph_concepts_detail::graph_t<Net>::Node *>;

          { net.is_single_source() } -> std::convertible_to<bool>;

          { net.is_single_sink() } -> std::convertible_to<bool>;

          { a->cap } -> std::convertible_to<typename graph_concepts_detail::graph_t<Net>::Flow_Type>;

          { a->flow } -> std::convertible_to<typename graph_concepts_detail::graph_t<Net>::Flow_Type>;

        }

Aleph::AlephGraph
A graph usable by the graph algorithms.
Definition ah-graph-concepts.H:109

Aleph::FlowNetwork
A flow network usable by the max-flow and min-cost algorithms.
Definition ah-graph-concepts.H:165

Aleph::graph_concepts_detail::graph_t
std::remove_cvref_t< GT > graph_t
GT with cv-qualifiers and references removed.
Definition ah-graph-concepts.H:95

Aleph::and
and
Check uniqueness with explicit hash + equality functors.
Definition ahFunctional.H:2648