6 * $Date: 2012-07-15 22:39:24 +0200 (So, 15. Jul 2012) $
7 ***************************************************************/
10 * \brief A simple embedder algorithm.
12 * \author Thorsten Kerkhof (thorsten.kerkhof@udo.edu)
15 * This file is part of the Open Graph Drawing Framework (OGDF).
19 * See README.txt in the root directory of the OGDF installation for details.
22 * This program is free software; you can redistribute it and/or
23 * modify it under the terms of the GNU General Public License
24 * Version 2 or 3 as published by the Free Software Foundation;
25 * see the file LICENSE.txt included in the packaging of this file
29 * This program is distributed in the hope that it will be useful,
30 * but WITHOUT ANY WARRANTY; without even the implied warranty of
31 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
32 * GNU General Public License for more details.
35 * You should have received a copy of the GNU General Public
36 * License along with this program; if not, write to the Free
37 * Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
38 * Boston, MA 02110-1301, USA.
40 * \see http://www.gnu.org/copyleft/gpl.html
41 ***************************************************************/
47 #ifndef OGDF_SIMPLE_EMBEDDER_H
48 #define OGDF_SIMPLE_EMBEDDER_H
50 #include <ogdf/module/EmbedderModule.h>
51 #include <ogdf/basic/extended_graph_alg.h>
52 #include <ogdf/basic/CombinatorialEmbedding.h>
53 #include <ogdf/planarity/PlanRep.h>
57 //! Planar graph embedding by using default planarEmbed.
58 class OGDF_EXPORT SimpleEmbedder
: public EmbedderModule
61 // construction / destruction
66 * \brief Call embedder algorithm.
67 * \param G is the original graph. Its adjacency list is changed by the embedder.
68 * \param adjExternal is an adjacency entry on the external face and is set by the embedder.
70 void call(Graph
& G
, adjEntry
& adjExternal
);
74 * \brief Find best suited external face according to certain criteria.
75 * \param PG is a planar representation of the original graph.
76 * \param E is a combinatorial embedding of the original graph.
77 * \return Best suited external face.
79 face
findBestExternalFace(const PlanRep
& PG
, const CombinatorialEmbedding
& E
);
83 } // end namespace ogdf