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
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
|
-- File: DirectedGraph.cdl
-- Created: Wed Apr 24 16:53:50 1991
-- Author: Denis PASCAL
-- <dp@topsn2>
generic class DirectedGraph from GraphDS
(GraphDS_Item as any ;
GraphDS_Attribute as any)
---Purpose: This class describes a structure which contains a
-- list of Vertices and a list of Edges. The vertex
-- (also called a Node), is the basic element of the
-- graph, it contains an Item. Each edge (also called
-- an Arc) defines an oriented link between two
-- vertices. it contains an Attribute. In the scheme
-- A->B, vertex A is called the SOURCE of the link, B
-- its DESTINATION, and B is ADJACENT to A. If there is
-- no edge which destinates to a vertex, this vertex is
-- a ROOT of the graph. If there is no edge which
-- originates from a vertex, this vertex is a LEAF of
-- the graph.
-- Keywords: SOURCE vertex, DESTINATION Vertex, ROOT vertex, LEAF
-- vertex, ADJACENT vertex. Depth-first search, breadth
-- first Search.
-- References: Software Components with ADA (The Benjamin/Cummings
-- Company, Inc. 1986).
uses MapOfTransient from TColStd
raises NoSuchObject from Standard,
DomainError from Standard
class Vertex inherits TShared from MMgt
---Purpose: nested public class vertex (composed of an
-- associated Item).
uses MapOfTransient from TColStd
raises NoSuchObject from Standard
is
Create (value : GraphDS_Item)
returns mutable Vertex from GraphDS;
--is private;
GetItem (me)
returns any GraphDS_Item;
---Purpose: returns item associated to <me>.
---C++: return const &
---Level: Internal
SetItem (me : mutable; value : GraphDS_Item);
---Purpose: Associates a new item to <me>.
---Level: Internal
Contains (me; E : Edge)
returns Boolean from Standard;
IsFront (me; E : Edge)
returns Boolean from Standard;
IsBack (me; E : Edge)
returns Boolean from Standard;
IsRoot (me; ignoreselfloop : Boolean from Standard = Standard_True)
---Purpose: Returns TRUE if NbBackEdges = 0.
---Level: Internal
returns Boolean from Standard;
IsLeaf (me; ignoreselfloop : Boolean from Standard = Standard_True)
---Purpose: Returns TRUE if NbFrontEdges = 0.
---Level: Internal
returns Boolean from Standard;
AddEdge (me : mutable; E : Edge)
returns Boolean from Standard
is private;
RemoveEdge (me : mutable; anEdge : Edge)
raises NoSuchObject from Standard
is private;
GetEdges (me)
returns MapOfTransient from TColStd
---C++: return const&
---Purpose: Returns <myEdges> field for Iterator;
---Level: Internal
is private;
fields
myItem : GraphDS_Item;
myEdges : MapOfTransient from TColStd;
friends
class DirectedGraph from GraphDS,
class Edge from GraphDS,
class VerticesIterator from GraphDS,
class EdgesIterator from GraphDS
end;
class Edge inherits TShared from MMgt
---Purpose: Nested public class Edge (composed of an
-- associated attribute) An Edge is an oriented link
-- between two vertices.
raises NoMoreObject from Standard ,
NoSuchObject from Standard
is
Create (source,destination : Vertex; value : GraphDS_Attribute)
returns mutable Edge;
--is private;
GetAttribute (me)
---Purpose: returns attribute associated to <me>.
---C++: return const &
---Level: Internal
returns any GraphDS_Attribute;
SetAttribute (me : mutable; Value : GraphDS_Attribute);
---Purpose: To associate a new attribute to <me>.
---Level: Internal
Contains (me; V : Vertex)
returns Boolean from Standard;
Source (me)
---C++: return const&
---Purpose: Returns the vertex which originates from <me>.
---Level: Internal
returns mutable Vertex;
Destination (me)
---C++: return const&
---Purpose: Returns the vertex which destinates to <me>.
---Level: Internal
returns mutable Vertex;
Reverse (me : mutable);
---Purpose: Reverse the orientation of <me>. the source
-- vertex becomes the destination vertex. And
-- the destination the source.
---Level: Internal
IsLoop (me)
returns Boolean from Standard;
---Purpose: Returns True if the source and destination vertices
-- are equal.
---Level: Internal
fields
myAttribute : GraphDS_Attribute;
mySource : Vertex from GraphDS;
myDestination : Vertex from GraphDS;
friends
class DirectedGraph from GraphDS,
class Vertex from GraphDS,
class VerticesIterator from GraphDS,
class EdgesIterator from GraphDS
end;
class VerticesIterator
---Purpose: basic tool to iterate on vertices.
-- 1 - vertices member of a DirectedGraph.
-- 2 - adjacent vertices of a given one.
uses MapOfTransient from TColStd,
MapIteratorOfMapOfTransient from TColStd
raises NoMoreObject from Standard,
NoSuchObject from Standard
is
Create
returns VerticesIterator from GraphDS;
Create (G : DirectedGraph from GraphDS)
returns VerticesIterator from GraphDS;
Create (G : DirectedGraph from GraphDS;
V : Vertex from GraphDS)
returns VerticesIterator from GraphDS;
Initialize (me : in out; G : DirectedGraph from GraphDS);
---Level: Public
Initialize (me : in out; G : DirectedGraph from GraphDS;
V : Vertex from GraphDS);
---Level: Public
More (me)
returns Boolean from Standard;
---Level: Public
Next (me : in out)
raises NoMoreObject from Standard;
---Level: Public
Value (me)
---C++: return const&
---Level: Public
returns Vertex
raises NoSuchObject from Standard;
fields
myMap : MapOfTransient from TColStd;
myVertices : MapIteratorOfMapOfTransient from TColStd;
end;
class EdgesIterator
---Purpose: basic tool to iterate on edges :
-- 1 - edges member of a DirectedGraph.
-- 2 - edges referenced by a given vertex.
uses MapIteratorOfMapOfTransient from TColStd
raises NoMoreObject from Standard ,
NoSuchObject from Standard
is
Create
returns EdgesIterator from GraphDS;
Create (G : DirectedGraph from GraphDS)
returns EdgesIterator from GraphDS;
Create (G : DirectedGraph from GraphDS;
V : Vertex from GraphDS)
returns EdgesIterator from GraphDS;
Initialize (me : in out; G : DirectedGraph from GraphDS);
---Level: Public
Initialize (me : in out; G : DirectedGraph from GraphDS;
V : Vertex from GraphDS);
---Level: Public
More (me)
returns Boolean from Standard;
---Level: Public
Next (me : in out)
raises NoMoreObject from Standard;
---Level: Public
Value (me)
---C++: return const&
---Level: Public
returns Edge
raises NoSuchObject from Standard;
fields
myEdges : MapIteratorOfMapOfTransient from TColStd;
end;
is
Create
returns DirectedGraph from GraphDS;
---Purpose: Create an empty Directed Graph.
IsEmpty (me)
returns Boolean from Standard;
---Level: Public
NbVertices (me)
returns Integer from Standard;
---Level: Public
NbEdges (me)
returns Integer from Standard;
---Level: Public
Clear (me : in out);
---Purpose: removes all edges and vertices of <me>.
---Level: Public
Contains (me; E : Edge)
returns Boolean from Standard;
---Level: Public
Contains (me; V : Vertex)
returns Boolean from Standard;
---Level: Public
IsRoot (me; V : Vertex; ignoreselfloop : Boolean from Standard = Standard_True)
returns Boolean from Standard;
---Level: Public
IsLeaf (me; V : Vertex; ignoreselfloop : Boolean from Standard = Standard_True)
returns Boolean from Standard;
---Level: Public
Add (me : in out; value : GraphDS_Item)
---Purpose: Creates a vertex, with a given Item <value>, and
-- Adds it to <me>. Of course this new Vertex
-- (returned by the method) is a "root" and "leaf"
-- vertex of <me>.
---Level: Public
returns mutable Vertex;
Remove (me : in out; V : Vertex)
---Purpose: Removes <V> from <me>. <NoSuchObject> is raised
-- if <V> is not member of <me>. <DomainError> is
-- raised if <V> is used by at least one edge of <me>
---Level: Public
raises NoSuchObject from Standard,
DomainError from Standard;
Add (me : in out; source : mutable Vertex;
destination : mutable Vertex;
value : GraphDS_Attribute)
---Purpose: Creates an Edge, with a given Attribute <value>,
-- from <source> to <destination>, and Adds it to
-- <me>. This new edge is returned by the method.
-- <NoSuchObject> is raised if <source> and/or
-- <destination> are not members of <me>.
---Level: Public
returns mutable Edge
raises NoSuchObject from Standard;
Remove (me : in out; E : Edge)
---Purpose: Removes <E> from <me>. <NoSuchObject> is raised if
-- <E> is not member of <me>.
---Level: Public
raises NoSuchObject from Standard;
fields
myVertices : MapOfTransient from TColStd;
myEdges : MapOfTransient from TColStd;
friends
class VerticesIterator from GraphDS,
class EdgesIterator from GraphDS
end;
|
