SubgraphUpwardPlanarizer.h File Reference

Declaration of class SubgraphUpwardPlanarizer. More...

#include <ogdf/decomposition/BCTree.h>
#include <ogdf/layered/AcyclicSubgraphModule.h>
#include <ogdf/layered/GreedyCycleRemoval.h>
#include <ogdf/upward/FUPSModule.h>
#include <ogdf/upward/FUPSSimple.h>
#include <ogdf/upward/FixedEmbeddingUpwardEdgeInserter.h>
#include <ogdf/upward/UpwardEdgeInserterModule.h>
#include <ogdf/upward/UpwardPlanRep.h>
#include <ogdf/upward/UpwardPlanarizerModule.h>
#include <memory>

Go to the source code of this file.

Classes
class	ogdf::SubgraphUpwardPlanarizer
	Takes an acyclic connected non-upward-planar graph and planarizes it, i.e., we obtain an upward-planar graph where crossings are represented via dummy vertices. More...

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declaration of class SubgraphUpwardPlanarizer.

Author

Hoi-Ming Wong

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