Changeset 1859:075aaa0a4e6f in lemon0.x
 Timestamp:
 12/14/05 19:11:03 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2431
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/grid_graph.h
r1791 r1859 229 229 /// the next edge from \c u to \c v after \c prev. 230 230 /// \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 { 232 232 if (prev != INVALID) return INVALID; 233 233 if (v.id  u.id == _width) return Edge(u.id); … … 350 350 /// This class implements a special graph type. The nodes of the 351 351 /// 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. 353 353 /// Two nodes are connected in the graph if the indices differ only 354 354 /// on one position and only one is the difference. … … 356 356 /// The graph can be indiced in the following way: 357 357 /// \code 358 /// GridGraph graph( h, w);358 /// GridGraph graph(w, h); 359 359 /// GridGraph::NodeMap<int> val(graph); 360 360 /// for (int i = 0; i < graph.width(); ++i) { … … 454 454 }; 455 455 456 /// \brief Constructor 457 /// 458 /// 456 459 GridGraph(int n, int m) { construct(n, m); } 457 460
Note: See TracChangeset
for help on using the changeset viewer.