COIN-OR::LEMON - Graph Library

Changeset 1859:075aaa0a4e6f in lemon-0.x for lemon/grid_graph.h


Ignore:
Timestamp:
12/14/05 19:11:03 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2431
Message:

Bug fix
and doc fix

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/grid_graph.h

    r1791 r1859  
    229229    /// the next edge from \c u to \c v after \c prev.
    230230    /// \return The found edge or INVALID if there is no such an edge.
    231     Edge findEdge(Node u, Node v, Edge prev = INVALID) {
     231    Edge findEdge(Node u, Node v, Edge prev = INVALID) const {
    232232      if (prev != INVALID) return INVALID;
    233233      if (v.id - u.id == _width) return Edge(u.id);
     
    350350  /// This class implements a special graph type. The nodes of the
    351351  /// graph can be indiced by two integer \c (i,j) value where \c i
    352   /// is in the \c [0,height) range and j is in the [0, width) range.
     352  /// is in the \c [0,width) range and j is in the [0, height) range.
    353353  /// Two nodes are connected in the graph if the indices differ only
    354354  /// on one position and only one is the difference.
     
    356356  /// The graph can be indiced in the following way:
    357357  /// \code
    358   /// GridGraph graph(h, w);
     358  /// GridGraph graph(w, h);
    359359  /// GridGraph::NodeMap<int> val(graph);
    360360  /// for (int i = 0; i < graph.width(); ++i) {
     
    454454    };
    455455
     456    /// \brief Constructor
     457    ///
     458    ///
    456459    GridGraph(int n, int m) { construct(n, m); }
    457460   
Note: See TracChangeset for help on using the changeset viewer.