# HG changeset patch
# User alpar
# Date 1108978080 0
# Node ID d9c32f713cad2f83b4b34b3e248ded8040e8b9a7
# Parent  504353f3c61c9d0823c2d0485f31bcb4039b5691
We have UndirGraph, so BidirGraph has been removed.

diff -r 504353f3c61c -r d9c32f713cad src/lemon/graph_wrapper.h
--- a/src/lemon/graph_wrapper.h	Sun Feb 20 01:03:09 2005 +0000
+++ b/src/lemon/graph_wrapper.h	Mon Feb 21 09:28:00 2005 +0000
@@ -1037,33 +1037,6 @@
   };
 
 
-  /// \brief A bidirected graph template.
-  ///
-  ///\warning Graph wrappers are in even more experimental state than the other
-  ///parts of the lib. Use them at you own risk.
-  ///
-  /// A bidirected graph template.
-  /// Such a bidirected graph stores each pair of oppositely directed edges 
-  /// ones in the memory, i.e. a directed graph of type 
-  /// \c Graph is used for that.
-  /// As the oppositely directed edges are logically different ones 
-  /// the maps are able to attach different values for them.
-  /// \ingroup graphs
-  template<typename Graph>
-  class BidirGraph : public BidirGraphWrapper<Graph> {
-  public:
-    typedef UndirGraphWrapper<Graph> Parent;
-  protected:
-    Graph gr;
-  public:
-    BidirGraph() : BidirGraphWrapper<Graph>() { 
-      Parent::setGraph(gr); 
-    }
-    //    KEEP_MAPS(Parent, BidirGraph);
-  };
-
-
-
   template<typename Graph, typename Number,
 	   typename CapacityMap, typename FlowMap>
   class ResForwardFilter {
diff -r 504353f3c61c -r d9c32f713cad src/test/graph_wrapper_test.cc
--- a/src/test/graph_wrapper_test.cc	Sun Feb 20 01:03:09 2005 +0000
+++ b/src/test/graph_wrapper_test.cc	Mon Feb 21 09:28:00 2005 +0000
@@ -56,7 +56,7 @@
     
     checkConcept<StaticGraph, SubBidirGraphWrapper<Graph, 
       Graph::EdgeMap<bool>, Graph::EdgeMap<bool> > >();
-    checkConcept<StaticGraph, BidirGraph<Graph> >();
+    //    checkConcept<StaticGraph, BidirGraph<Graph> >();
     checkConcept<StaticGraph, ResGraphWrapper<Graph, int, 
       Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();