# source:lemon-0.x/doc/flf-graph.texi@45:8fe92d6829e8

Last change on this file since 45:8fe92d6829e8 was 26:383e95b237c4, checked in by Alpar Juttner, 18 years ago

a @tie nem megy a neumannon

File size: 8.0 KB
Line
1@node The Full Feature Graph Class
2@section The Full Feature Graph Class
3@cindex Full Feature Graph Class
4
5This section describes what an imaginary full feature graph class knows.
6The set of features provided by a real graph implementation is typically
7a subset of the features below.
8
9On the other hand, each graph algorithm requires the underlying graph
10structure to provide a certain (typically small) set of features in order
11to be able to run.
12
13@subsection Declaration
14
15@deftp {Class} {class Graph}
16@code{Graph} is the imaginary @emph{full feature graph class}.
17@code{G} denotes the instance of this class in the exaples below.
18@c Each node and edge has a user defined data sturcure
19@c @var{N} and @var{E} statically attached to it.
20@end deftp
21
22@subsection Types
23
24@deftp {Type} Graph::NodeType
25@deftpx {Type} Graph::EdgeType
26The type of the data stored statically for each node and edge.
27@end deftp
28
29@anchor{Graph-NodeIterator}
30@deftp {Type} Graph::NodePoint
31@deftpx {Type} Graph::NodeIterator
32These types points a node uniquely. The difference between the
33@code{NodePoint} and the @code{NodeIterator} is that @code{NodePoint}
34requires the graph structure itself for most of the operations.
35For examples using iterators you can go through all nodes as follows.
36@quotation
37@verbatim
38Graph G;
39int nodenum=0;
40for(Graph::NodeIterator n(G);n.Valid();++n) ++nodenum;
41@end verbatim
42@end quotation
43Using @code{NodePoint} the last line looks like this.
44@quotation
45@verbatim
46for(MyGraph::NodePoint n(G);n.Valid();n=G.Next(n)) ++nodenum;
47@end verbatim
48@end quotation
49or
50@quotation
51@verbatim
52MyGraph::NodePoint n;
53for(G.GetFirst(n);G.Valid(n);G.GoNext(n)) ++nodenum;
54@end verbatim
55@end quotation
56@end deftp
57
58@deftp {Type} Graph::EdgePoint
59@deftpx {Type} Graph::InEdgePoint
60@deftpx {Type} Graph::OutEdgePoint
61@deftpx {Type} Graph::BiEdgePoint
62@deftpx {Type} Graph::SymEdgePoint
63Each of these types points an edge uniquely. The difference between the
64@code{EdgePoint} and the
65@c @mref{Graph-NodeIterator,@code{EdgeIterator}}
66@mref{Graph-NodeIterator , EdgeIterator}
67series is that
68@code{EdgePoint} requires the graph structure itself for most of the
69operations.
70@end deftp
71
72@anchor{Graph-EdgeIterator}
73@deftp {Type} Graph::EdgeIterator
74@deftpx {Type} Graph::InEdgeIterator
75@deftpx {Type} Graph::OutEdgeIterator
76@deftpx {Type} Graph::BiEdgeIterator
77@deftpx {Type} Graph::SymEdgeIterator
78@deftpx {Type} Graph::AllEdgeIterator
79Each of these types points an edge uniquely. The difference between the
80@code{EdgePoint} and the @code{EdgeIterator} series is that
81@code{EdgePoint} requires the graph structure itself for most of the
82operations.
83
84For the @code{EdgeIterator} types you can use operator @code{++}
85(both the prefix and the posfix one) to obtain the next edge.
86@end deftp
87
88@deftp {Type} Graph::NodeMap
89@deftpx {Type} Graph::EdgeMap
90There are the default property maps for the edges and the nodes.
91@end deftp
92
93
94@subsection Member Functions
95
96@subsubsection Constructors
97
98
99@deftypefun { } Graph::Graph ()
100The default constructor.
101@end deftypefun
102
103@c @deftypefun { } Graph::Graph (Graph@tie{}&)
104@deftypefun { } Graph::Graph (Graph &)
105The copy constructor. Not yet implemented.
106@end deftypefun
107
108@subsubsection Graph Maintenence Operations
109
111Adds a new node to the graph and returns a @code{NodeIterator} pointing to it.
112@end deftypefun
113
114@deftypefun EdgeIterator Graph::AddEdge (@w{const @mref{Graph-NodeIterator,NodeIterator} @var{from}}, @w{const @mref{Graph-NodeIterator,NodeIterator} @var{to}})
115Adds a new edge with tail @var{from} and head @var{to} to the graph
116and returns an @code{EdgeIterator} pointing to it.
117@end deftypefun
118
119@deftypefun void Graph::Delete (@w{const @mref{Graph-NodeIterator,NodeIterator} @var{n}})
120Deletes the node @var{n}. It also deletes the adjacent edges.
121@end deftypefun
122
123@deftypefun void Graph::Delete (@w{const @mref{Graph-EdgeIterator,EdgeIterator} @var{e}})
124Deletes the edge @var{n}.
125@end deftypefun
126
127@deftypefun void Graph::Clean ()
128Deletes all edges and nodes from the graph.
129@end deftypefun
130
131@deftypefun int Graph::NodeNum ()
132Returns the number of the nodes in the graph.
133@end deftypefun
134
135@subsubsection NodePoint Operations
136
137@deftypefun NodePoint Graph::GetFirst (NodePoint &@var{n})
138@deftypefunx NodePoint Graph::Next (const NodePoint @var{n})
139@deftypefunx {NodePoint &} Graph::GoNext (NodePoint &@var{n})
140The nodes in the graph forms a list. @code{GetFirst(n)} sets @var{n} to
141be the first node. @code{Next(n)} gives back the subsequent
142node. @code{Next(n)} is equivalent to @code{n=Next(n)}, though it
143might be faster.  ??? What should be the return value ???
144@end deftypefun
145
146@deftypefun bool Graph::Valid (NodePoint &@var{e})
147@deftypefunx bool NodePoint::Valid ()
148These functions check if and NodePoint is valid or not.
149??? Which one should be implemented ???
150@end deftypefun
151
152@subsubsection EdgePoint Operations
153
154@deftypefun AllEdgePoint Graph::GetFirst (const AllEdgePoint & @var{e})
155@deftypefunx AllEdgePoint Graph::Next (const AllEdgePoint @var{n})
156@deftypefunx {AllEdgePoint &} Graph::GoNext (AllEdgePoint &@var{n})
157With these functions you can go though all the edges of the graph.
158??? What should be the return value ???
159@end deftypefun
160
161@deftypefun InEdgePoint Graph::GetFirst (const InEdgePoint & @var{e}, const NodePoint @var{n})
162@deftypefunx OutEdgePoint Graph::GetFirst (const OutEdgePoint & @var{e}, const NodePoint @var{n})
163@deftypefunx SymEdgePoint Graph::GetFirst (const SymEdgePoint & @var{e}, const NodePoint @var{n})
164The edges leaving from, arriving at or adjacent with a node forms a
165list.  These functions give back the first elements of these
166lists. The exact behavior depends on the type of @var{e}.
167
168If @var{e} is an @code{InEdgePoint} or an @code{OutEdgePoint} then
169@code{GetFirst} sets @var{e} to be the first incoming or outgoing edge
170of the node @var{n}, respectively.
171
172If @var{e} is a @code{SymEdgePoint} then
173@code{GetFirst} sets @var{e} to be the first incoming if there exists one
174otherwise the first outgoing edge.
175
176If there are no such edges, @var{e} will be invalid.
177
178@end deftypefun
179
180@deftypefun InEdgePoint Graph::Next (const InEdgePoint @var{e})
181@deftypefunx OutEdgePoint Graph::Next (const OutEdgePoint @var{e})
182@deftypefunx SymEdgePoint Graph::Next (const SymEdgePoint @var{e})
183These functions give back the edge that follows @var{e}
184@end deftypefun
185
186@deftypefun {InEdgePoint &} Graph::GoNext (InEdgePoint &@var{e})
187@deftypefunx {OutEdgePoint &} Graph::GoNext (OutEdgePoint &@var{e})
188@deftypefunx {SymEdgePoint &} Graph::GoNext (SymEdgePoint &@var{e})
189@code{G.GoNext(e)} is equivalent to @code{e=G.Next(e)}, though it
190might be faster.
191??? What should be the return value ???
192@end deftypefun
193
194@deftypefun bool Graph::Valid (EdgePoint &@var{e})
195@deftypefunx bool EdgePoint::Valid ()
196These functions check if and EdgePoint is valid or not.
197??? Which one should be implemented ???
198@end deftypefun
199
200@deftypefun NodePoint Graph::From (const EdgePoint @var{e})
201@deftypefunx NodePoint Graph::To (const EdgePoint @var{e})
202@deftypefunx NodePoint Graph::ANode (const InEdgePoint @var{e})
203@deftypefunx NodePoint Graph::ANode (const OutEdgePoint @var{e})
204@deftypefunx NodePoint Graph::ANode (const SymEdgePoint @var{e})
205@deftypefunx NodePoint Graph::BNode (const InEdgePoint @var{e})
206@deftypefunx NodePoint Graph::BNode (const OutEdgePoint @var{e})
207@deftypefunx NodePoint Graph::BNode (const SymEdgePoint @var{e})
208There queries give back the two endpoints of the edge @var{e}.  For a
209directed edge @var{e}, @code{From(e)} and @code{To(e)} is its tail and
210its head, respectively. For an undirected @var{e}, they are two
211endpoints, but you should not rely on which end is which.
212
213@code{ANode(e)} is the node which @var{e} is bounded to, i.e. it is
214equal to @code{From(e)} if @var{e} is an @code{OutEdgePoint} and
215@code{To(e)} if @var{e} is an @code{InEdgePoint}. If @var{e} is a
216@code{SymEdgePoint} and it or its first preceding edge was created by
217@code{GetFirst(e,n)}, then @code{ANode(e)} is equal to @var{n}.
218
219@code{BNode(e)} is the other end of the edge.
220
221???It it implemented in an other way now. (Member function <-> Graph global)???
222@end deftypefun
223
224
225
226@c @deftypevar int from
227@c  the tail of the created edge.
228@c @end deftypevar
Note: See TracBrowser for help on using the repository browser.