Changeset 1591:03aa0a6c8dca in lemon-0.x for lemon
- Timestamp:
- 07/26/05 22:14:03 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2095
- Location:
- lemon
- Files:
-
- 2 edited
-
graph_utils.h (modified) (1 diff)
-
matrix_graph.h (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
lemon/graph_utils.h
r1590 r1591 218 218 /// Iterator for iterating on edges connected the same nodes. It is 219 219 /// higher level interface for the findEdge() function. You can 220 /// use it the following wa s:220 /// use it the following way: 221 221 /// \code 222 222 /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { -
lemon/matrix_graph.h
r1590 r1591 262 262 /// on one position and only one is the difference. 263 263 /// 264 /// The graph can be indiced in the following wa s:264 /// The graph can be indiced in the following way: 265 265 /// \code 266 266 /// MatrixGraph graph(h, w);
Note: See TracChangeset
for help on using the changeset viewer.

