blob: 8f8cf0078b7aa12a203912192a2a83caaf1587d2 (
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
-- File: GraphTools_ConnectedVerticesIterator.cdl
-- Created: Thu Mar 18 17:41:39 1993
-- Author: Denis PASCAL
-- <dp@bravox>
---Copyright: Matra Datavision 1993
generic class ConnectedVerticesIterator from GraphTools
(Graph as any;
Vertex as any;
GIterator as any;
CVIterator as any)
--generic class ConnectedVerticesIterator from GraphTools
-- (Graph as any;
-- Vertex as any;
-- GIterator as GraphIterator (Graph,Vertex))
-- CVIterator as ConnectedVerticesFromIterator
---Purpose: In a graph, returns subsets of a list of vertices in
-- which all vertices are connected.
is
Create
---Purpose: Create an empty algorithm.
returns ConnectedVerticesIterator from GraphTools;
Create (G : Graph)
---Purpose: Create the algorithm setting each vertex of <G>
-- reached by GIterator tool, as initial conditions.
-- Use Perform method before visting the result of
-- the algorithm.
returns ConnectedVerticesIterator from GraphTools;
FromGraph (me : in out; G : Graph);
---Purpose: Add each vertex of <G> reached by GIterator tool
-- as initial conditions. Use Perform method
-- before visiting the result of the algorithm.
---Level: Public;
FromVertex (me : in out; V : Vertex);
---Purpose: Add <V> as research condition. This method is
-- cumulative. User must used Perform method before
-- visting the result of the algorithm.
---Level: Public
Reset (me : in out);
---Purpose: Reset the algorithm. It may be reused with new
-- initial conditions.
---Level: Public
Perform (me : in out; G : Graph);
---Purpose: Peform the algorithm in <G> from initial setted
-- conditions.
---Level: Public
More(me)
---Purpose: Returns TRUE if there are others subset of
-- connected vertices.
---Level: Public
returns Boolean from Standard;
Next (me : in out);
---Purpose: Set the iterator to the next subset of connected
-- vertices.
---Level: Public
NbVertices (me)
returns Integer from Standard;
---Purpose: Returns number of vertices of the current subset
-- of connected vertices.
---Level: Public
Value (me; index : Integer from Standard)
returns any Vertex;
---Purpose: Returns a vertex member of the current subset of
-- connected vertices.
---Level: Public
---C++: return const&
fields
myIterator : CVIterator;
end ConnectedVerticesIterator;
|
