Changeset 169:5b507a86ad72 in lemon-1.2
- Timestamp:
- 06/15/08 09:19:53 (16 years ago)
- Branch:
- default
- Phase:
- public
- Location:
- lemon
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concepts/graph_components.h
r107 r169 1425 1425 typename _Graph::Node node; 1426 1426 graph.erase(node); 1427 typename _Graph:: Arc arc;1428 graph.erase( arc);1427 typename _Graph::Edge edge; 1428 graph.erase(edge); 1429 1429 } 1430 1430 -
lemon/dijkstra.h
r157 r169 23 23 ///\file 24 24 ///\brief Dijkstra algorithm. 25 /// 26 27 #include <lemon/list_digraph.h> 25 26 #include <lemon/list_graph.h> 28 27 #include <lemon/bin_heap.h> 29 28 #include <lemon/bits/path_dump.h> … … 31 30 #include <lemon/error.h> 32 31 #include <lemon/maps.h> 33 34 32 35 33 namespace lemon { -
lemon/graph_utils.h
r157 r169 403 403 g.firstInc(e, b, u); 404 404 } else { 405 b = g. source(e) == u;405 b = g.u(e) == u; 406 406 g.nextInc(e, b); 407 407 } 408 while (e != INVALID && (b ? g. target(e) : g.source(e)) != v) {408 while (e != INVALID && (b ? g.v(e) : g.u(e)) != v) { 409 409 g.nextInc(e, b); 410 410 } … … 416 416 g.nextInc(e, b); 417 417 } 418 while (e != INVALID && (!b || g. target(e) != v)) {418 while (e != INVALID && (!b || g.v(e) != v)) { 419 419 g.nextInc(e, b); 420 420 } … … 456 456 ///\endcode 457 457 /// 458 ///\sa Con ArcIt458 ///\sa ConEdgeIt 459 459 460 460 template <typename Graph> … … 505 505 /// It increments the iterator and gives back the next edge. 506 506 ConEdgeIt& operator++() { 507 Parent::operator=(findEdge(_graph, _graph. source(*this),508 _graph. target(*this), *this));507 Parent::operator=(findEdge(_graph, _graph.u(*this), 508 _graph.v(*this), *this)); 509 509 return *this; 510 510 }
Note: See TracChangeset
for help on using the changeset viewer.