EmbedderMinDepthMaxFace.h File Reference

Computes an embedding of a graph with minimum depth and maximum external face. See paper "Graph Embedding with Minimum Depth and Maximum External Face" by C. Gutwenger and P. Mutzel (2004) for details. More...

#include <ogdf/module/EmbedderModule.h>
#include <ogdf/decomposition/BCTree.h>
#include <ogdf/internal/planarity/EmbedderMDMFLengthAttribute.h>

Go to the source code of this file.

Classes
class	ogdf::EmbedderMinDepthMaxFace
	Planar graph embedding with minimum block-nesting depth and maximum external face. More...
Namespaces
namespace	ogdf
	The namespace for all OGDF objects.
Defines
#define	OGDF_EMBEDDER_MIN_DEPTH_MAX_FACE_H

---

Detailed Description

Computes an embedding of a graph with minimum depth and maximum external face. See paper "Graph Embedding with Minimum Depth and Maximum External Face" by C. Gutwenger and P. Mutzel (2004) for details.

Author:

Thorsten Kerkhof

License:

This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C). All rights reserved. See README.txt in the root directory of the OGDF installation 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

See also:

http://www.gnu.org/copyleft/gpl.html

Definition in file EmbedderMinDepthMaxFace.h.

---

Define Documentation

#define OGDF_EMBEDDER_MIN_DEPTH_MAX_FACE_H

Definition at line 50 of file EmbedderMinDepthMaxFace.h.