COIN-OR::LEMON - Graph Library

Changeset 1590:ba2cb5006358 in lemon-0.x


Ignore:
Timestamp:
07/26/05 22:12:36 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2094
Message:

Spellcheck

Files:
3 edited

Legend:

Unmodified
Added
Removed
  • doc/adaptor_references.dox

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

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

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