/
DAG.java
267 lines (212 loc) · 6.5 KB
/
DAG.java
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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
package org.codehaus.plexus.util.dag;
/*
* Copyright The Codehaus Foundation.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
import java.io.Serializable;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
/**
* DAG = Directed Acyclic Graph
*
* @author <a href="michal.maczka@dimatics.com">Michal Maczka</a>
*
* TODO this class should be renamed from DAG to Dag
*/
public class DAG
implements Cloneable, Serializable
{
// ------------------------------------------------------------
// Fields
// ------------------------------------------------------------
/**
* Nodes will be kept in two data structures at the same time for faster processing
*/
/**
* Maps vertex's label to vertex
*/
private Map<String, Vertex> vertexMap = new HashMap<String, Vertex>();
/**
* Conatin list of all vertices
*/
private List<Vertex> vertexList = new ArrayList<Vertex>();
// ------------------------------------------------------------
// Constructors
// ------------------------------------------------------------
/**
*
*/
public DAG()
{
super();
}
// ------------------------------------------------------------
// Accessors
// ------------------------------------------------------------
/**
* @return
*/
public List<Vertex> getVertices()
{
return vertexList;
}
/**
* @deprecated instead use {@link #getVertices()}
*/
@Deprecated
public List<Vertex> getVerticies()
{
return getVertices();
}
public Set<String> getLabels()
{
return vertexMap.keySet();
}
// ------------------------------------------------------------
// Implementation
// ------------------------------------------------------------
/**
* Adds vertex to DAG. If vertex of given label already exist in DAG no vertex is added
*
* @param label The label of the Vertex
* @return New vertex if vertex of given label was not present in the DAG or existing vertex if vertex of given
* label was already added to DAG
*/
public Vertex addVertex( final String label )
{
Vertex retValue = null;
// check if vertex is already in DAG
if ( vertexMap.containsKey( label ) )
{
retValue = vertexMap.get( label );
}
else
{
retValue = new Vertex( label );
vertexMap.put( label, retValue );
vertexList.add( retValue );
}
return retValue;
}
public void addEdge( final String from, final String to )
throws CycleDetectedException
{
final Vertex v1 = addVertex( from );
final Vertex v2 = addVertex( to );
addEdge( v1, v2 );
}
public void addEdge( final Vertex from, final Vertex to )
throws CycleDetectedException
{
from.addEdgeTo( to );
to.addEdgeFrom( from );
final List<String> cycle = CycleDetector.introducesCycle( to );
if ( cycle != null )
{
// remove edge which introduced cycle
removeEdge( from, to );
final String msg = "Edge between '" + from + "' and '" + to + "' introduces to cycle in the graph";
throw new CycleDetectedException( msg, cycle );
}
}
public void removeEdge( final String from, final String to )
{
final Vertex v1 = addVertex( from );
final Vertex v2 = addVertex( to );
removeEdge( v1, v2 );
}
public void removeEdge( final Vertex from, final Vertex to )
{
from.removeEdgeTo( to );
to.removeEdgeFrom( from );
}
public Vertex getVertex( final String label )
{
final Vertex retValue = vertexMap.get( label );
return retValue;
}
public boolean hasEdge( final String label1, final String label2 )
{
final Vertex v1 = getVertex( label1 );
final Vertex v2 = getVertex( label2 );
final boolean retValue = v1.getChildren().contains( v2 );
return retValue;
}
/**
* @param label
* @return
*/
public List<String> getChildLabels( final String label )
{
final Vertex vertex = getVertex( label );
return vertex.getChildLabels();
}
/**
* @param label
* @return
*/
public List<String> getParentLabels( final String label )
{
final Vertex vertex = getVertex( label );
return vertex.getParentLabels();
}
/**
* @see java.lang.Object#clone()
*/
@Override
public Object clone()
throws CloneNotSupportedException
{
// this is what's failing..
final Object retValue = super.clone();
return retValue;
}
/**
* Indicates if there is at least one edge leading to or from vertex of given label
*
* @return <code>true</code> if this vertex is connected with other vertex,<code>false</code> otherwise
*/
public boolean isConnected( final String label )
{
final Vertex vertex = getVertex( label );
final boolean retValue = vertex.isConnected();
return retValue;
}
/**
* Return the list of labels of successor in order decided by topological sort
*
* @param label The label of the vertex whose predecessors are searched
* @return The list of labels. Returned list contains also the label passed as parameter to this method. This label
* should always be the last item in the list.
*/
public List<String> getSuccessorLabels( final String label )
{
final Vertex vertex = getVertex( label );
final List<String> retValue;
// optimization.
if ( vertex.isLeaf() )
{
retValue = new ArrayList<String>( 1 );
retValue.add( label );
}
else
{
retValue = TopologicalSorter.sort( vertex );
}
return retValue;
}
}