Calculate minimum cut value for a given Graph. 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/Logger.h>
#include <ogdf/basic/basic.h>
#include <ogdf/graphalg/MinimumCutModule.h>
#include <algorithm>
#include <unordered_set>
#include <vector>

Classes
class	ogdf::MinimumCutNagamochiIbaraki
	Calculate minimum cut value for a given Graph. More...

struct	ogdf::MinimumCutNagamochiIbaraki::adjInfo

struct	ogdf::MinimumCutNagamochiIbaraki::BoundedList

struct	ogdf::MinimumCutNagamochiIbaraki::clusterstruct

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.

Macros
#define	OGDF_MINCUTNI_CLUSTERSIZE 10

#define	OGDF_MINCUTNI_MAXLISTSIZE 100

#define	OGDF_MINCUTNI_PRTHR 100

Detailed Description

Calculate minimum cut value for a given Graph.

Author: Sascha Alder

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.