blob: 19001f4752852c4323e24047912ac62def71243d (
plain)
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
|
-- File: GraphTools_DFSIterator.cdl
-- Created: Thu Sep 24 15:57:35 1992
-- Author: Denis PASCAL
-- <dp@bravox>
---Copyright: Matra Datavision 1992
generic class DFSIterator from GraphTools
(Graph as any;
Vertex as any;
VHasher as any;
VIterator as any)
---Purpose: This generic class implement the Depth First Search
-- algorithm from a Vertex with an iterator to reached
-- adjacent vertices of a given one. The interface of
-- this algorithm is made as an iterator.
--generic class DFSIterator from GraphTools
-- (Graph as any;
-- Vertex as any;
-- VHasher as MapHasher from TCollection (Vertex);
-- VIterator as VertexIterator (Graph,Vertex))
raises NoMoreObject from Standard,
NoSuchObject from Standard
class DFSMap instantiates IndexedMap from TCollection (Vertex,VHasher);
is
Create
returns DFSIterator;
---Purpose: Create an empty iterator.
Perform (me : in out; G : Graph; V : Vertex);
---Purpose: Initializes the research from <V> member vertex of
-- <G>.
---Level: Public
More (me) returns Boolean from Standard;
---Purpose: Returns True if there are other vertices.
---Level: Public
Next(me : in out)
---Purpose: Set the iterator to the next vertex.
---Level: Public
raises NoMoreObject from Standard;
Value (me) returns any Vertex
---Purpose: returns the vertex value for the current position
-- of the iterator.
---C++: return const &
---Level: Public
raises NoSuchObject from Standard;
fields
myVisited : DFSMap from GraphTools;
myCurrentIndex : Integer from Standard;
end DFSIterator;
|
