1.1 --- a/src/hugo/graph_wrapper.h	Wed May 12 13:19:32 2004 +0000
     1.2 +++ b/src/hugo/graph_wrapper.h	Wed May 12 13:22:10 2004 +0000
     1.3 @@ -904,15 +904,15 @@
     1.4        EdgeMap(const BidirGraphWrapper<Graph>& _G, T a) : forward_map(*(_G.graph), a), backward_map(*(_G.graph), a) { }
     1.5        void set(Edge e, T a) { 
     1.6  	if (!e.backward) 
     1.7 -	  forward_map.set(e.out, a); 
     1.8 +	  forward_map.set(e/*.out*/, a); 
     1.9  	else 
    1.10 -	  backward_map.set(e.in, a); 
    1.11 +	  backward_map.set(e/*.in*/, a); 
    1.12        }
    1.13        T operator[](Edge e) const { 
    1.14  	if (!e.backward) 
    1.15 -	  return forward_map[e.out]; 
    1.16 +	  return forward_map[e/*.out*/]; 
    1.17  	else 
    1.18 -	  return backward_map[e.in]; 
    1.19 +	  return backward_map[e/*.in*/]; 
    1.20        }
    1.21  //       T get(Edge e) const { 
    1.22  // 	if (e.out_or_in)