Ignore:
Timestamp:
06/15/08 09:19:53 (12 years ago)
Branch:
default
Phase:
public
Message:

Fix various rename bugs

Location:
lemon
Files:
3 edited

Unmodified
Removed
• ## lemon/concepts/graph_components.h

 r107 typename _Graph::Node node; graph.erase(node); typename _Graph::Arc arc; graph.erase(arc); typename _Graph::Edge edge; graph.erase(edge); }
• ## lemon/dijkstra.h

 r157 ///\file ///\brief Dijkstra algorithm. /// #include #include #include #include #include #include namespace lemon {
• ## lemon/graph_utils.h

 r157 g.firstInc(e, b, u); } else { b = g.source(e) == u; b = g.u(e) == u; g.nextInc(e, b); } while (e != INVALID && (b ? g.target(e) : g.source(e)) != v) { while (e != INVALID && (b ? g.v(e) : g.u(e)) != v) { g.nextInc(e, b); } g.nextInc(e, b); } while (e != INVALID && (!b || g.target(e) != v)) { while (e != INVALID && (!b || g.v(e) != v)) { g.nextInc(e, b); } ///\endcode /// ///\sa ConArcIt ///\sa ConEdgeIt template /// It increments the iterator and gives back the next edge. ConEdgeIt& operator++() { Parent::operator=(findEdge(_graph, _graph.source(*this), _graph.target(*this), *this)); Parent::operator=(findEdge(_graph, _graph.u(*this), _graph.v(*this), *this)); return *this; }
Note: See TracChangeset for help on using the changeset viewer.