Changeset 1859:075aaa0a4e6f in lemon-0.x

Timestamp:

12/14/05 19:11:03 (18 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:

• lemon/grid_graph.h (modified) (4 diffs)

lemon/grid_graph.h

@@ -229 +229 @@
     /// the next edge from \c u to \c v after \c prev.
     /// \return The found edge or INVALID if there is no such an edge.
-    Edge findEdge(Node u, Node v, Edge prev = INVALID) {
+    Edge findEdge(Node u, Node v, Edge prev = INVALID) const {
       if (prev != INVALID) return INVALID;
       if (v.id - u.id == _width) return Edge(u.id);
@@ -350 +350 @@
   /// This class implements a special graph type. The nodes of the
   /// graph can be indiced by two integer \c (i,j) value where \c i
-  /// is in the \c [0,height) range and j is in the [0, width) range.
+  /// is in the \c [0,width) range and j is in the [0, height) range.
   /// Two nodes are connected in the graph if the indices differ only
   /// on one position and only one is the difference. 
@@ -356 +356 @@
   /// The graph can be indiced in the following way:
   /// \code
-  /// GridGraph graph(h, w);
+  /// GridGraph graph(w, h);
   /// GridGraph::NodeMap<int> val(graph); 
   /// for (int i = 0; i < graph.width(); ++i) {
@@ -454 +454 @@
     };
 
+    /// \brief Constructor
+    ///
+    /// 
     GridGraph(int n, int m) { construct(n, m); }