equal
deleted
inserted
replaced
15 |
15 |
16 /// This macro provides a comfortable interface for iterating with HUGO |
16 /// This macro provides a comfortable interface for iterating with HUGO |
17 /// iterators. |
17 /// iterators. |
18 /// \code |
18 /// \code |
19 /// Graph g; |
19 /// Graph g; |
|
20 /// ... |
20 /// Graph::NodeIt n; |
21 /// Graph::NodeIt n; |
21 /// FOR_EACH_GLOB(n, g) { |
22 /// FOR_EACH_GLOB(n, g) { |
22 /// ... |
23 /// ... |
23 /// } |
24 /// } |
24 /// Graph::EdgeIt e; |
25 /// Graph::EdgeIt e; |
31 |
32 |
32 /// This macro provides a comfortable interface for iterating with HUGO |
33 /// This macro provides a comfortable interface for iterating with HUGO |
33 /// iterators. |
34 /// iterators. |
34 /// \code |
35 /// \code |
35 /// Graph g; |
36 /// Graph g; |
|
37 /// ... |
36 /// Graph::Node v; |
38 /// Graph::Node v; |
37 /// Graph::OutEdgeIt e; |
39 /// Graph::OutEdgeIt e; |
38 /// FOR_EACH_INC_GLOB(e, g, v) { |
40 /// FOR_EACH_INC_GLOB(e, g, v) { |
39 /// ... |
41 /// ... |
40 /// } |
42 /// } |
41 /// typedef BipartiteGraph<Graph> BGraph; |
43 /// typedef BipartiteGraph<Graph> BGraph; |
42 /// BGraph h; |
44 /// BGraph h; |
|
45 /// ... |
43 /// BGraph::ClassNodeIt n; |
46 /// BGraph::ClassNodeIt n; |
44 /// FOR_EACH_INC_GLOB(BGraph::ClassNodeIt, n, h, h.S_CLASS) { |
47 /// FOR_EACH_INC_GLOB(BGraph::ClassNodeIt, n, h, h.S_CLASS) { |
45 /// ... |
48 /// ... |
46 /// } |
49 /// } |
47 /// \endcode |
50 /// \endcode |
118 |
121 |
119 /// This macro provides a comfortable interface for iterating with HUGO |
122 /// This macro provides a comfortable interface for iterating with HUGO |
120 /// iterators. |
123 /// iterators. |
121 /// \code |
124 /// \code |
122 /// Graph g; |
125 /// Graph g; |
|
126 /// ... |
123 /// FOR_EACH_LOC(Graph::NodeIt, n, g) { |
127 /// FOR_EACH_LOC(Graph::NodeIt, n, g) { |
124 /// ... |
128 /// ... |
125 /// } |
129 /// } |
126 /// FOR_EACH_LOC(Graph::EdgeIt, e, g) { |
130 /// FOR_EACH_LOC(Graph::EdgeIt, e, g) { |
127 /// ... |
131 /// ... |
132 |
136 |
133 /// This macro provides a comfortable interface for iterating with HUGO |
137 /// This macro provides a comfortable interface for iterating with HUGO |
134 /// iterators. |
138 /// iterators. |
135 /// \code |
139 /// \code |
136 /// Graph g; |
140 /// Graph g; |
|
141 /// ... |
137 /// Graph::Node v; |
142 /// Graph::Node v; |
138 /// FOR_EACH_INC_LOC(Graph::OutEdgeIt, e, g, v) { |
143 /// FOR_EACH_INC_LOC(Graph::OutEdgeIt, e, g, v) { |
139 /// ... |
144 /// ... |
140 /// } |
145 /// } |
141 /// typedef BipartiteGraph<Graph> BGraph; |
146 /// typedef BipartiteGraph<Graph> BGraph; |
142 /// BGraph h; |
147 /// BGraph h; |
|
148 /// ... |
143 /// FOR_EACH_INC_LOC(BGraph::ClassNodeIt, n, h, h.S_CLASS) { |
149 /// FOR_EACH_INC_LOC(BGraph::ClassNodeIt, n, h, h.S_CLASS) { |
144 /// ... |
150 /// ... |
145 /// } |
151 /// } |
146 /// \endcode |
152 /// \endcode |
147 /// Note that the iterated variables \c e and \c n are local ones. |
153 /// Note that the iterated variables \c e and \c n are local ones. |