# Changeset 1591:03aa0a6c8dca in lemon-0.x

Ignore:
Timestamp:
07/26/05 22:14:03 (16 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2095
Message:

Spellrecheck

Files:
3 edited

### Legend:

Unmodified
Removed

 r1590 The adaptors usually use references or pointers to reference to an existing data structure. We may use an algorithm in the following was: existing data structure. We may use an algorithm in the following way: \code function_algorithm(adaptor(structure));
• ## lemon/graph_utils.h

 r1590 /// Iterator for iterating on edges connected the same nodes. It is /// higher level interface for the findEdge() function. You can /// use it the following was: /// use it the following way: /// \code /// for (ConEdgeIt it(g, src, trg); it != INVALID; ++it) {
• ## lemon/matrix_graph.h

 r1590 /// on one position and only one is the difference. /// /// The graph can be indiced in the following was: /// The graph can be indiced in the following way: /// \code /// MatrixGraph graph(h, w);
Note: See TracChangeset for help on using the changeset viewer.