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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
|
/**
* @file: aux_edge.h
* Layout Edge class
*
* Graph for performing layouts, consists of dummy nodes.
* Layout library, 2d graph placement of graphs in ShowGraph tool.
* Copyright (c) 2009, Boris Shurygin
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* AuxGraph, AuxNode and AuxEdge classes represent auxiliary graph used for layout purposes
*/
#ifndef AUX_EDGE_H
#define AUX_EDGE_H
/**
* Edge types
*
* @ingroup Layout
*/
enum AuxEdgeType
{
/** Unknown type (typically before classification) */
UNKNOWN_TYPE_EDGE = 0,
/** Tree edge */
TREE_EDGE,
/** Back edge */
BACK_EDGE,
/** Forward edge */
FORWARD_EDGE,
/** Self-edge */
SELF_EDGE,
/** Number of edge types */
EDGE_TYPES_NUM
};
/**
* Edge of model graph used in Layout
*
* @ingroup Layout
*/
class AuxEdge: public Edge
{
bool priv_fixed;
AuxEdgeType priv_type;
protected:
/** Constructors are made private, only nodes and graph can create edges */
AuxEdge( AuxGraph *graph_p, int _id, AuxNode *_pred, AuxNode* _succ);
public:
friend class AuxGraph;
friend class AuxNode;
/** Get node in given direction */
inline AuxNode *node( GraphDir dir) const
{
return static_cast< AuxNode *>( Edge::node( dir));
}
/** Get predecessor */
inline AuxNode *pred() const
{
return node( GRAPH_DIR_UP);
}
/** Get successor */
inline AuxNode *succ() const
{
return node( GRAPH_DIR_DOWN);
}
/** insert node on this edge */
inline AuxNode *insertNode()
{
return static_cast< AuxNode *>( Edge::insertNode());
}
/** Next edge in graph's list */
inline AuxEdge* nextEdge()
{
return static_cast< AuxEdge *>( Edge::nextEdge());
}
/** Next edge in give direction */
inline AuxEdge* nextEdgeInDir( GraphDir dir)
{
return static_cast< AuxEdge *>( Edge::nextEdgeInDir( dir));
}
/** Next successor */
inline AuxEdge* nextSucc()
{
return nextEdgeInDir( GRAPH_DIR_DOWN);
}
/** Next predecessor */
inline AuxEdge* nextPred()
{
return nextEdgeInDir( GRAPH_DIR_UP);
}
/** Check if an edge is fixed */
inline bool isFixed() const
{
return priv_fixed;
}
/** Set edge to be fixed */
inline void setFixed( bool fx)
{
priv_fixed = fx;
}
/** Check if edge was classified as a 'Backedge' */
inline bool isBack() const
{
return priv_type == BACK_EDGE;
}
/** Get edge type */
inline AuxEdgeType type() const
{
return priv_type;
}
/** Set edge type */
inline void setType( AuxEdgeType t = UNKNOWN_TYPE_EDGE)
{
if ( isSelf())
{
return;
}
priv_type = t;
}
/** Set edge to be of unknown type */
inline void setUnknown()
{
setType( UNKNOWN_TYPE_EDGE);
}
/** Set edge to be a tree edge */
inline void setTree()
{
setType( TREE_EDGE);
}
/** Set edge to be a backedge */
inline void setBack()
{
setType( BACK_EDGE);
}
/** Set edge to be a forward edge */
inline void setForward()
{
priv_type = FORWARD_EDGE;
}
/** Set edge to be a self-edge */
inline void setSelf()
{
assertd( pred() == succ());
setType( SELF_EDGE);
}
/** Check if edge is a self-edge */
inline bool isSelf() const
{
return pred() == succ();
}
/** Check whether this edge is inverted */
inline bool isInverted() const
{
return isBack();
}
/** Return real node in given direction */
inline AuxNode* realNode( GraphDir dir) const
{
AuxNode* n = node( dir);
assertd( isNotNullP( n));
while ( n->isPseudo())
{
n = n->firstEdgeInDir( dir)->node( dir);
}
return n;
}
/** Get real predecessor */
inline AuxNode* realPred() const
{
return realNode( GRAPH_DIR_UP);
}
/** Get real successor */
inline AuxNode* realSucc() const
{
return realNode( GRAPH_DIR_DOWN);
}
};
#endif /* AUX_EDGE_H */
|
