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
|
/*
* $Revision: 2523 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-07-02 20:59:27 +0200 (Mon, 02 Jul 2012) $
***************************************************************/
/** \file
* \brief Declaration and implementation of GraphReduction class
* reduces by Leaves & Chains.
*
* \author Markus Chimani
*
* \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
***************************************************************/
#ifndef OGDF_GRAPH_REDUCTION_H
#define OGDF_GRAPH_REDUCTION_H
#include <ogdf/basic/NodeArray.h>
#include <ogdf/basic/EdgeArray.h>
#include <ogdf/basic/SList.h>
#include <ogdf/basic/CombinatorialEmbedding.h>
namespace ogdf {
//---------------------------------------------------------
// GraphReduction
// kick leaves & chains
// GraphReduction is read-only !!!
//---------------------------------------------------------
class OGDF_EXPORT GraphReduction : public Graph {
protected:
const Graph *m_pGraph; // original graph
NodeArray<node> m_vOrig; // corresponding node in original graph
EdgeArray<List<edge> > m_eOrig; // corresponding edge in original graph
NodeArray<node> m_vReduction; // corresponding node in graph copy
EdgeArray<edge> m_eReduction; // corresponding chain of edges in graph copy
GraphReduction() : m_vOrig(), m_eOrig(), m_vReduction(), m_eReduction() {}
public:
// construction
GraphReduction(const Graph& G);
virtual ~GraphReduction() { }
// returns original graph
const Graph &original() const { return *m_pGraph; }
// returns original node
node original(node v) const { return m_vOrig[v]; }
// returns original edges
const List<edge> &original(edge e) const { return m_eOrig[e]; }
// returns reduction of node v (0 if none)
node reduction(node v) const { return m_vReduction[v]; }
// returns reduction of edge e
edge reduction(edge e) const { return m_eReduction[e]; }
}; // class GraphCopy
} // end namespace ogdf
#endif
|
