CPlanarEdgeInserter.h File Reference

Declares CPlanarEdgeInserter class. More...

#include <ogdf/basic/CombinatorialEmbedding.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/SList.h>
#include <ogdf/basic/basic.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <iosfwd>

Go to the source code of this file.

Classes
class	ogdf::CPlanarEdgeInserter
	Edge insertion algorithm for clustered graphs. More...
class	ogdf::List< E >
	Doubly linked lists (maintaining the length of the list). More...

Namespaces
	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declares CPlanarEdgeInserter class.

Reinsertion of deleted edges in embedded subgraph with modeled cluster boundaries. The inserter class computes a shortest path on the dual graph of the input to find an insertion path

Author

Karsten Klein

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