Changeset 1627:3fd1ba6e9872 in lemon0.x for lemon/concept/graph_component.h
 Timestamp:
 08/11/05 17:55:17 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2135
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/concept/graph_component.h
r1620 r1627 679 679 /// 680 680 /// Gives back the base node of the iterator. 681 /// It is always the target of the pointed edge. 681 682 Node baseNode(const InEdgeIt&) const { return INVALID; } 682 683 … … 684 685 /// 685 686 /// Gives back the running node of the iterator. 687 /// It is always the source of the pointed edge. 686 688 Node runningNode(const InEdgeIt&) const { return INVALID; } 687 689 … … 689 691 /// 690 692 /// Gives back the base node of the iterator. 693 /// It is always the source of the pointed edge. 691 694 Node baseNode(const OutEdgeIt&) const { return INVALID; } 692 695 … … 694 697 /// 695 698 /// Gives back the running node of the iterator. 699 /// It is always the target of the pointed edge. 696 700 Node runningNode(const OutEdgeIt&) const { return INVALID; } 701 702 /// \brief The opposite node on the given edge. 703 /// 704 /// Gives back the opposite on the given edge. 705 /// \todo It should not be here. 706 Node oppositeNode(const Node&, const Edge&) const { return INVALID; } 697 707 698 708 … … 708 718 checkConcept<GraphIncIterator<_Graph>, typename _Graph::InEdgeIt>(); 709 719 checkConcept<GraphIncIterator<_Graph>, typename _Graph::OutEdgeIt>(); 710 } 720 721 typename _Graph::Node n; 722 typename _Graph::Edge e; 723 n = graph.oppositeNode(n, e); 724 } 725 726 const _Graph& graph; 727 711 728 }; 712 729 };
Note: See TracChangeset
for help on using the changeset viewer.