Aleph::Edge_Connectivity< GT, Max_Flow > Class Template Reference

Functor wrapper for edge_connectivity(). More...

#include <tpl_kgraph.H>

Public Member Functions
long	operator() (GT &g)
	Compute edge connectivity of g.

Detailed Description

template<class GT, template< class > class Max_Flow = Heap_Preflow_Maximum_Flow>
class Aleph::Edge_Connectivity< GT, Max_Flow >

Functor wrapper for edge_connectivity().

Template Parameters

GT	Graph type (undirected).
Max_Flow	Maximum flow functor.

Definition at line 209 of file tpl_kgraph.H.

Member Function Documentation

operator()()

template<class GT , template< class > class Max_Flow = Heap_Preflow_Maximum_Flow>

long Aleph::Edge_Connectivity< GT, Max_Flow >::operator() ( GT &  g )

inline

Compute edge connectivity of g.

Parameters

[in,out]

g

Graph to analyze.

Returns

Edge connectivity of g.

Exceptions

std::domain_error	If g is a digraph.
std::bad_alloc	If there is not enough memory.

Definition at line 219 of file tpl_kgraph.H.

References Aleph::maps().

---

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

• tpl_kgraph.H