MaxFlowSTPlanarDigraph.h File Reference

Max-Flow on s-t-planar graphs (s and t lie on the boundary of the outer face) via shortest paths in the dual. More...

#include <ogdf/basic/CombinatorialEmbedding.h>
#include <ogdf/basic/DualGraph.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphCopy.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/extended_graph_alg.h>
#include <ogdf/basic/simple_graph_alg.h>
#include <ogdf/graphalg/Dijkstra.h>
#include <ogdf/graphalg/MaxFlowModule.h>
#include <limits>

Go to the source code of this file.

Classes
class	ogdf::MaxFlowSTPlanarDigraph< TCap >
	Computes a max flow in s-t-planar network via dual shortest paths. More...

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.

Detailed Description

Max-Flow on s-t-planar graphs (s and t lie on the boundary of the outer face) via shortest paths in the dual.

See [Ahuja, Magnanti, Orlin: Network Flows. Section 8.4]. Runtime: O(V log V).

Author

Ivo Hedtke

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 MaxFlowSTPlanarDigraph.h.