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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
/*
* $Revision: 3556 $
*
* last checkin:
* $Author: beyer $
* $Date: 2013-06-07 19:36:11 +0200 (Fri, 07 Jun 2013) $
***************************************************************/
/** \file
* \brief Declaration of functions for drawing module precondition
* handling.
*
* \author Karsten Klein
*
* \attention This is legacy code from UML class diagram handling,
* and it should be checked if it is still required.
*
* \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_PRECONDITION_H
#define OGDF_PRECONDITION_H
#include <ogdf/orthogonal/EdgeRouter.h>
#include <ogdf/uml/UMLGraph.h>
namespace ogdf {
//descent the hierarchy tree at "sink" v recursively
bool dfsGenTreeRec(
UMLGraph& UG,
EdgeArray<bool> &used,
NodeArray<int> &hierNumber, //number of hierarchy tree
// A node is visited if its hierNumber != 0
int hierNum,
node v,
List<edge>& fakedGens, //temporary
bool fakeTree)
{
OGDF_ASSERT(hierNumber[v] == 0);
hierNumber[v] = hierNum;
bool returnValue = true;
edge e;
forall_adj_edges(e,v) {
if (e->source() == v) continue;
if (!(UG.type(e) == Graph::generalization)) continue;
if (used[e]) continue; //error ??
used[e] = true;
node w = e->opposite(v);
if (hierNumber[w]) {
//temporarily fake trees
//if (hierNumber[w] == hierNum) //forward search edge
if (fakeTree)
{
//UG.type(e) = Graph::association;
fakedGens.pushBack(e);
continue;
}
else return false;//reached w over unused edge => no tree
}
returnValue = dfsGenTreeRec(UG, used, hierNumber, hierNum, w, fakedGens, fakeTree);
//shortcut
if (!returnValue) return false;
}
return returnValue;
}
edge firstOutGen(UMLGraph& UG, node v, EdgeArray<bool>& /* used */)
{
edge e;
forall_adj_edges(e, v)
{
if (e->target() == v) continue;
if (UG.type(e) == Graph::generalization)
{
//OGDF_ASSERT(!used[e]);
return e;
}
else continue;
}//forall
return 0;
}//firstOutGen
bool dfsGenTree(
UMLGraph& UG,
List<edge>& fakedGens,
bool fakeTree)
{
edge e;
EdgeArray<bool> used(UG.constGraph(), false);
//NodeArray<bool> visited(UG,false);
NodeArray<int> hierNumber(UG.constGraph(), 0);
int hierNum = 0; //number of hierarchy tree
const Graph& G = UG.constGraph();
forall_edges(e, G)
{
//descent in the hierarchy containing e
if ((!used[e]) && (UG.type(e) == Graph::generalization))
{
hierNum++; //current hierarchy tree
//first we search for the sink
node sink = e->target();
edge sinkPath = firstOutGen(UG, e->target(), used);
int cycleCounter = 0;
while (sinkPath)
{
sink = sinkPath->target();
sinkPath = firstOutGen(UG, sinkPath->target(), used);
cycleCounter++;
//if there is no sink, convert Generalizations to Associations and draw
if (cycleCounter > G.numberOfEdges())
{
UG.type(sinkPath) = Graph::association;
fakedGens.pushBack(sinkPath);
sink = sinkPath->source();
sinkPath = 0;
}
}
//now sink is the hierarchy sink
//used is set in dfsGenTreeRec
bool isTree = dfsGenTreeRec(UG, used, hierNumber, hierNum, sink, fakedGens, fakeTree);
if (!isTree) return false;
}
}//forall_edges
return true;
}
}//end namespace ogdf
#endif
|
