1.1 --- a/src/lemon/concept/sym_graph.h	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/lemon/concept/sym_graph.h	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -450,27 +450,27 @@
     1.4        ///
     1.5        SymEdgeIt& first(SymEdgeIt& i) const { return i; }
     1.6  
     1.7 -      ///Gives back the head node of an edge.
     1.8 +      ///Gives back the target node of an edge.
     1.9  
    1.10 -      ///Gives back the head node of an edge.
    1.11 +      ///Gives back the target node of an edge.
    1.12        ///
    1.13 -      Node head(Edge) const { return INVALID; }
    1.14 -      ///Gives back the tail node of an edge.
    1.15 +      Node target(Edge) const { return INVALID; }
    1.16 +      ///Gives back the source node of an edge.
    1.17  
    1.18 -      ///Gives back the tail node of an edge.
    1.19 +      ///Gives back the source node of an edge.
    1.20        ///
    1.21 -      Node tail(Edge) const { return INVALID; }
    1.22 +      Node source(Edge) const { return INVALID; }
    1.23    
    1.24        ///Gives back the first node of an symmetric edge.
    1.25  
    1.26        ///Gives back the first node of an symmetric edge.
    1.27        ///
    1.28 -      Node head(SymEdge) const { return INVALID; }
    1.29 +      Node target(SymEdge) const { return INVALID; }
    1.30        ///Gives back the second node of an symmetric edge.
    1.31  
    1.32        ///Gives back the second node of an symmetric edge.
    1.33        ///
    1.34 -      Node tail(SymEdge) const { return INVALID; }
    1.35 +      Node source(SymEdge) const { return INVALID; }
    1.36        ///Gives back the \e id of a node.
    1.37  
    1.38        ///\warning Not all graph structures provide this feature.
    1.39 @@ -607,8 +607,8 @@
    1.40        Node addNode() { return INVALID; }
    1.41        ///Add a new edge to the graph.
    1.42  
    1.43 -      ///Add a new symmetric edge to the graph with tail node \c t
    1.44 -      ///and head node \c h.
    1.45 +      ///Add a new symmetric edge to the graph with source node \c t
    1.46 +      ///and target node \c h.
    1.47        ///\return the new edge.
    1.48        SymEdge addEdge(Node h, Node t) { return INVALID; }
    1.49