1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/*
* $Revision: 2523 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-07-02 20:59:27 +0200 (Mon, 02 Jul 2012) $
***************************************************************/
/** \file
* \brief Includes declaration of dual graph class.
*
* \author Michael Schulz
*
* \par License:
* This file is part of the Open Graph Drawing Framework (OGDF).
*
* \par
* Copyright (C)<br>
* See README.txt in the root directory of the OGDF installation for details.
*
* \par
* 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.
*
* \par
* 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.
*
* \par
* 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 http://www.gnu.org/copyleft/gpl.html
***************************************************************/
#ifdef _MSC_VER
#pragma once
#endif
#ifndef OGDF_DUAL_GRAPH_H
#define OGDF_DUAL_GRAPH_H
#include <ogdf/basic/CombinatorialEmbedding.h>
#include <ogdf/basic/NodeArray.h>
#include <ogdf/basic/EdgeArray.h>
#include <ogdf/basic/FaceArray.h>
namespace ogdf {
//! A dual graph including its combinatorial embedding of an embedded graph
class OGDF_EXPORT DualGraph : public CombinatorialEmbedding
{
public:
//! Constructor; creates dual graph and its combinatorial embedding
DualGraph(CombinatorialEmbedding &CE);
//! Destructor
~DualGraph();
//! Returns a reference to the combinatorial embedding of the primal graph
const CombinatorialEmbedding &getPrimalEmbedding() const { return *m_primalEmbedding; }
//! Returns a reference to the primal graph
const Graph &getPrimalGraph() const { return m_primalEmbedding->getGraph(); }
//! Returns the node in the primal graph corresponding to \a f.
/**
* @param f is a face in the embedding of the dual graph
* \return the corresponding node in the primal graph
*/
const node &primalNode(face f) const { return m_primalNode[f]; }
//! Returns the edge in the primal graph corresponding to \a e.
/**
* @param e is an edge in the dual graph
* \return the corresponding edge in the primal graph
*/
const edge &primalEdge(edge e) const { return m_primalEdge[e]; }
//! Returns the face in the embedding of the primal graph corresponding to \a v.
/**
* @param v is a node in the dual graph
* \return the corresponding face in the embedding of the primal graph
*/
const face &primalFace(node v) const { return m_primalFace[v]; }
//! Returns the node in the dual graph corresponding to \a f.
/**
* @param f is a face in the embedding of the primal graph
* \return the corresponding node in the dual graph
*/
const node &dualNode(face f) const { return m_dualNode[f]; }
//! Returns the edge in the dual graph corresponding to \a e.
/**
* @param e is an edge in the primal graph
* \return the corresponding edge in the dual graph
*/
const edge &dualEdge(edge e) const { return m_dualEdge[e]; }
//! Returns the face in the embedding of the dual graph corresponding to \a v.
/**
* @param v is a node in the primal graph
* \return the corresponding face in the embedding of the dual graph
*/
const face &dualFace(node v) const { return m_dualFace[v]; }
protected:
CombinatorialEmbedding *m_primalEmbedding; //!< The embedding of the primal graph.
FaceArray<node> m_primalNode; //!< The corresponding node in the primal graph.
NodeArray<face> m_primalFace; //!< The corresponding facee in the embedding of the primal graph.
EdgeArray<edge> m_primalEdge; //!< The corresponding edge in the primal graph.
FaceArray<node> m_dualNode; //!< The corresponding node in the dual graph.
NodeArray<face> m_dualFace; //!< The corresponding face in embedding of the dual graph.
EdgeArray<edge> m_dualEdge; //!< The corresponding edge in the dual graph.
}; // class DualGraph
} // end namespace ogdf
#endif
|
