diff -r e251336be488 -r 3fd1ba6e9872 lemon/graph_adaptor.h
--- a/lemon/graph_adaptor.h	Thu Aug 11 15:24:24 2005 +0000
+++ b/lemon/graph_adaptor.h	Thu Aug 11 15:55:17 2005 +0000
@@ -105,13 +105,12 @@
   
     void clear() const { graph->clear(); }
     
-    bool forward(const Edge& e) const { return graph->forward(e); }
-    bool backward(const Edge& e) const { return graph->backward(e); }
-
     int id(const Node& v) const { return graph->id(v); }
     int id(const Edge& e) const { return graph->id(e); }
     
-    Edge opposite(const Edge& e) const { return Edge(graph->opposite(e)); }
+    Edge oppositeNode(const Edge& e) const { 
+      return Edge(graph->opposite(e)); 
+    }
 
     template <typename _Value>
     class NodeMap : public _Graph::template NodeMap<_Value> {
@@ -608,14 +607,14 @@
 	forward_map(*(g->graph), a), backward_map(*(g->graph), a) { }
       
       void set(Edge e, T a) { 
-	if (g->forward(e)) 
+	if (g->direction(e)) 
 	  forward_map.set(e, a); 
 	else 
 	  backward_map.set(e, a); 
       }
 
       T operator[](Edge e) const { 
-	if (g->forward(e)) 
+	if (g->direction(e)) 
 	  return forward_map[e]; 
 	else 
 	  return backward_map[e];