Aleph::Dinic_Maximum_Flow< Net > Struct Template Reference

Functor wrapper for Dinic's algorithm. More...

#include <tpl_maxflow.H>

Public Member Functions
Net::Flow_Type	operator() (Net &net) const
	Invoke Dinic's maximum flow algorithm on the given network.

Detailed Description

template<class Net>
struct Aleph::Dinic_Maximum_Flow< Net >

Functor wrapper for Dinic's algorithm.

Definition at line 494 of file tpl_maxflow.H.

Member Function Documentation

operator()()

template<class Net >

Net::Flow_Type Aleph::Dinic_Maximum_Flow< Net >::operator() ( Net &  net ) const

inline

Invoke Dinic's maximum flow algorithm on the given network.

This functor provides a convenient way to call dinic_maximum_flow as a function object, useful for passing to algorithms or storing in containers.

Parameters

[in]

net

Flow network with a single source and sink.

Returns

Maximum flow value of type typename Net::Flow_Type.

Exceptions

domain_error	If network is not single source/sink.
std::bad_alloc	If memory allocation fails during algorithm execution.

Note

Complexity: O(V²E) for general graphs, O(E√V) for unit capacity graphs.

Thread safety: Not thread-safe. Modifies network state and node cookies.

Exception safety: Basic guarantee. Network may be partially modified.

Definition at line 510 of file tpl_maxflow.H.

References Aleph::dinic_maximum_flow().

---

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

• tpl_maxflow.H