1.1 --- a/src/lemon/concept/graph.h Sat Nov 13 12:24:01 2004 +0000
1.2 +++ b/src/lemon/concept/graph.h Sat Nov 13 12:53:28 2004 +0000
1.3 @@ -363,16 +363,16 @@
1.4 // ///
1.5 // EdgeIt& first(EdgeIt& 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 \e id of a node.
1.25
1.26 @@ -538,8 +538,8 @@
1.27 // n=m=INVALID;
1.28 // Edge e;
1.29 // e=INVALID;
1.30 -// n=G.tail(e);
1.31 -// n=G.head(e);
1.32 +// n=G.source(e);
1.33 +// n=G.target(e);
1.34 // }
1.35 // // id tests
1.36 // { Node n; int i=G.id(n); i=i; }
1.37 @@ -665,8 +665,8 @@
1.38 // Node addNode() { return INVALID; }
1.39 // ///Add a new edge to the graph.
1.40
1.41 -// ///Add a new edge to the graph with tail node \c t
1.42 -// ///and head node \c h.
1.43 +// ///Add a new edge to the graph with source node \c t
1.44 +// ///and target node \c h.
1.45 // ///\return the new edge.
1.46 // Edge addEdge(Node h, Node t) { return INVALID; }
1.47
1.48 @@ -800,8 +800,8 @@
1.49 void nextOutEdge(Edge &e) const { }
1.50 void nextInEdge(Edge &e) const { }
1.51
1.52 - Node head(Edge) const { return Node(); }
1.53 - Node tail(Edge) const { return Node(); }
1.54 + Node target(Edge) const { return Node(); }
1.55 + Node source(Edge) const { return Node(); }
1.56
1.57
1.58 // Do we need id, nodeNum, edgeNum and co. in this basic graphbase