Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

CconnectClusterPlanarEmbed.h File Reference

Cluster planarity tests and cluster planar embedding for c-connected clustered graphs. Based on the algorithm by Cohen, Feng and Eades which uses PQ-trees. More...

Go to the source code of this file.

Classes

class  ogdf::CconnectClusterPlanarEmbed
 C-planarity test and embedding by Cohen, Feng and Eades. More...
 
class  ogdf::ListPure< E >
 Doubly linked lists. More...
 

Namespaces

 ogdf
 The namespace for all OGDF objects.
 

Detailed Description

Cluster planarity tests and cluster planar embedding for c-connected clustered graphs. Based on the algorithm by Cohen, Feng and Eades which uses PQ-trees.

Author
Sebastian Leipert
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 CconnectClusterPlanarEmbed.h.