hao_orlin.h File Reference

Detailed Description

Implementation of the Hao-Orlin algorithm for finding a minimum cut in a digraph.

#include <vector>
#include <list>
#include <limits>
#include <lemon/maps.h>
#include <lemon/core.h>
#include <lemon/tolerance.h>

Classes
class	HaoOrlin< GR, CAP, TOL >
	Hao-Orlin algorithm for finding a minimum cut in a digraph. More...

Namespaces
	lemon
	The namespace of LEMON.