Changeset 125:19e82bda606a in lemon1.2
 Timestamp:
 04/14/08 18:37:18 (13 years ago)
 Branch:
 default
 Phase:
 public
 Location:
 lemon
 Files:

 4 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bits/graph_extender.h
r107 r125 368 368 369 369 Node oppositeNode(const Node &n, const Edge &e) const { 370 if( n == Parent:: source(e))371 return Parent:: target(e);372 else if( n == Parent:: target(e))373 return Parent:: source(e);370 if( n == Parent::u(e)) 371 return Parent::v(e); 372 else if( n == Parent::v(e)) 373 return Parent::u(e); 374 374 else 375 375 return INVALID; … … 382 382 using Parent::direct; 383 383 Arc direct(const Edge &edge, const Node &node) const { 384 return Parent::direct(edge, Parent:: source(edge) == node);384 return Parent::direct(edge, Parent::u(edge) == node); 385 385 } 386 386 … … 587 587 /// Returns the base node of the iterator 588 588 Node baseNode(const IncEdgeIt &edge) const { 589 return edge._direction ? source(edge) : target(edge);589 return edge._direction ? u(edge) : v(edge); 590 590 } 591 591 /// Running node of the iterator … … 593 593 /// Returns the running node of the iterator 594 594 Node runningNode(const IncEdgeIt &edge) const { 595 return edge._direction ? target(edge) : source(edge);595 return edge._direction ? v(edge) : u(edge); 596 596 } 597 597 
lemon/concepts/digraph.h
r107 r125 468 468 }; 469 469 470 template <typename RDigraph>470 template <typename _Digraph> 471 471 struct Constraints { 472 472 void constraints() { 473 checkConcept<IterableDigraphComponent<>, Digraph>();474 checkConcept<IDableDigraphComponent<>, Digraph>();475 checkConcept<MappableDigraphComponent<>, Digraph>();473 checkConcept<IterableDigraphComponent<>, _Digraph>(); 474 checkConcept<IDableDigraphComponent<>, _Digraph>(); 475 checkConcept<MappableDigraphComponent<>, _Digraph>(); 476 476 } 477 477 }; 
lemon/concepts/graph.h
r107 r125 732 732 } 733 733 734 template <typename Graph>734 template <typename _Graph> 735 735 struct Constraints { 736 736 void constraints() { 737 checkConcept<IterableGraphComponent<>, Graph>();738 checkConcept<IDableGraphComponent<>, Graph>();739 checkConcept<MappableGraphComponent<>, Graph>();737 checkConcept<IterableGraphComponent<>, _Graph>(); 738 checkConcept<IDableGraphComponent<>, _Graph>(); 739 checkConcept<MappableGraphComponent<>, _Graph>(); 740 740 } 741 741 }; 
lemon/smart_graph.h
r109 r125 471 471 Node target(Arc e) const { return Node(arcs[e._id].target); } 472 472 473 Node source(Edge e) const { return Node(arcs[2 * e._id].target); }474 Node target(Edge e) const { return Node(arcs[2 * e._id + 1].target); }473 Node u(Edge e) const { return Node(arcs[2 * e._id].target); } 474 Node v(Edge e) const { return Node(arcs[2 * e._id + 1].target); } 475 475 476 476 static bool direction(Arc e) {
Note: See TracChangeset
for help on using the changeset viewer.