Changeset 1160:d9c32f713cad in lemon-0.x

Timestamp:

02/21/05 10:28:00 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1561

Message:

We have UndirGraph?, so BidirGraph? has been removed.

Location:

src

Files:

• lemon/graph_wrapper.h (modified) (1 diff)
• test/graph_wrapper_test.cc (modified) (1 diff)

src/lemon/graph_wrapper.h

@@ -1038 +1038 @@
 
 
-  /// \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>

src/test/graph_wrapper_test.cc

@@ -57 +57 @@
     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> > >();