lemon-0.x: comparison src/lemon/concept/graph

equal deleted inserted replaced

-:06c57b251ce2
+:c44dfdb4ba8a
 	/// This ordering can be different from the iterating order of edges.
 	/// \todo Possibly we don't need it.
 	bool operator<(const Edge&) const { return true;}
 };
-///Gives back the head node of an edge.
+///Gives back the target node of an edge.
-///Gives back the head node of an edge.
+///Gives back the target node of an edge.
 ///
-Node head(const Edge&) const { return INVALID;}
+Node target(const Edge&) const { return INVALID;}
-///Gives back the tail node of an edge.
+///Gives back the source node of an edge.
-///Gives back the tail node of an edge.
+///Gives back the source node of an edge.
 ///
-Node tail(const Edge&) const { return INVALID;}
+Node source(const Edge&) const { return INVALID;}
 };
 /// Concept check structure for BaseGraph.
 	function_requires< GraphItemConcept<Node> >();
 	function_requires< GraphItemConcept<Edge> >();
 	{
 	  Node n;
 	  Edge e;
-	  n = graph.tail(e);
+	  n = graph.source(e);
-	  n = graph.head(e);
+	  n = graph.target(e);
 	}
 }
 const Graph& graph;
 };