Changeset 1591:03aa0a6c8dca in lemon-0.x
- Timestamp:
- 07/26/05 22:14:03 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2095
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/adaptor_references.dox
r1590 r1591 12 12 13 13 The adaptors usually use references or pointers to reference to an 14 existing data structure. We may use an algorithm in the following wa s:14 existing data structure. We may use an algorithm in the following way: 15 15 \code 16 16 function_algorithm(adaptor(structure)); -
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.