Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

MinCostFlowReinelt.h File Reference

Definition of ogdf::MinCostFlowReinelt class template. More...

#include <ogdf/basic/Array.h>
#include <ogdf/basic/EpsilonTest.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/memory.h>
#include <ogdf/graphalg/MinCostFlowModule.h>
#include <cstdlib>
#include <limits>

Go to the source code of this file.

Classes

class  ogdf::MinCostFlowReinelt< TCost >
 Computes a min-cost flow using a network simplex method. More...
 
struct  ogdf::MinCostFlowReinelt< TCost >::arctype
 
struct  ogdf::MinCostFlowReinelt< TCost >::nodetype
 

Namespaces

 ogdf
 The namespace for all OGDF objects.
 

Detailed Description

Definition of ogdf::MinCostFlowReinelt class template.

Author
Carsten Gutwenger and Gerhard Reinelt
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 MinCostFlowReinelt.h.