MinimumCutStoerWagner.h File Reference

Declaration and implementation of ogdf::MinimumCutStoerWagner. More...

#include <ogdf/basic/ArrayBuffer.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphCopy.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/Math.h>
#include <ogdf/basic/PriorityQueue.h>
#include <ogdf/basic/basic.h>
#include <ogdf/graphalg/MinimumCutModule.h>
#include <functional>
#include <limits>
#include <utility>

Go to the source code of this file.

Classes
struct	ogdf::MinimumCutStoerWagner< T >
	Computes a minimum cut in a graph. More...

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declaration and implementation of ogdf::MinimumCutStoerWagner.

Author

Mathias Jansen, Stephan Beyer

License:

This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C)
See README.md in the OGDF root directory for details.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file MinimumCutStoerWagner.h.