changeset 1590 | ba2cb5006358 |
parent 1565 | 96244ea562a3 |
child 1591 | 03aa0a6c8dca |
1.1 --- a/lemon/graph_utils.h Tue Jul 26 18:14:23 2005 +0000 1.2 +++ b/lemon/graph_utils.h Tue Jul 26 20:12:36 2005 +0000 1.3 @@ -217,7 +217,7 @@ 1.4 /// 1.5 /// Iterator for iterating on edges connected the same nodes. It is 1.6 /// higher level interface for the findEdge() function. You can 1.7 - /// use it the next way: 1.8 + /// use it the following was: 1.9 /// \code 1.10 /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { 1.11 /// ...