UpwardPlanarity.h File Reference

Declaration of class UpwardPlanarity, which implements different types of algorithms testing upward planarity of graphs with different restrictions. Actually, restrictions are: More...

#include <ogdf/basic/CombinatorialEmbedding.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>

Go to the source code of this file.

Classes
class	ogdf::List< E >
	Doubly linked lists (maintaining the length of the list). More...
class	ogdf::SList< E >
	Singly linked lists (maintaining the length of the list). More...
class	ogdf::UpwardPlanarity
	Upward planarity testing and embedding. More...

Namespaces
	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declaration of class UpwardPlanarity, which implements different types of algorithms testing upward planarity of graphs with different restrictions. Actually, restrictions are:

• general acyclic digraphs (using satisfiability)
• fixed embedding
• single source
• triconnected

Also allows to compute a maximal feasible upward planar subgraph.

Author

Robert Zeranski

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