We have UndirGraph, so BidirGraph has been removed.
1.1 --- a/src/lemon/graph_wrapper.h Sun Feb 20 01:03:09 2005 +0000
1.2 +++ b/src/lemon/graph_wrapper.h Mon Feb 21 09:28:00 2005 +0000
1.3 @@ -1037,33 +1037,6 @@
1.4 };
1.5
1.6
1.7 - /// \brief A bidirected graph template.
1.8 - ///
1.9 - ///\warning Graph wrappers are in even more experimental state than the other
1.10 - ///parts of the lib. Use them at you own risk.
1.11 - ///
1.12 - /// A bidirected graph template.
1.13 - /// Such a bidirected graph stores each pair of oppositely directed edges
1.14 - /// ones in the memory, i.e. a directed graph of type
1.15 - /// \c Graph is used for that.
1.16 - /// As the oppositely directed edges are logically different ones
1.17 - /// the maps are able to attach different values for them.
1.18 - /// \ingroup graphs
1.19 - template<typename Graph>
1.20 - class BidirGraph : public BidirGraphWrapper<Graph> {
1.21 - public:
1.22 - typedef UndirGraphWrapper<Graph> Parent;
1.23 - protected:
1.24 - Graph gr;
1.25 - public:
1.26 - BidirGraph() : BidirGraphWrapper<Graph>() {
1.27 - Parent::setGraph(gr);
1.28 - }
1.29 - // KEEP_MAPS(Parent, BidirGraph);
1.30 - };
1.31 -
1.32 -
1.33 -
1.34 template<typename Graph, typename Number,
1.35 typename CapacityMap, typename FlowMap>
1.36 class ResForwardFilter {
2.1 --- a/src/test/graph_wrapper_test.cc Sun Feb 20 01:03:09 2005 +0000
2.2 +++ b/src/test/graph_wrapper_test.cc Mon Feb 21 09:28:00 2005 +0000
2.3 @@ -56,7 +56,7 @@
2.4
2.5 checkConcept<StaticGraph, SubBidirGraphWrapper<Graph,
2.6 Graph::EdgeMap<bool>, Graph::EdgeMap<bool> > >();
2.7 - checkConcept<StaticGraph, BidirGraph<Graph> >();
2.8 + // checkConcept<StaticGraph, BidirGraph<Graph> >();
2.9 checkConcept<StaticGraph, ResGraphWrapper<Graph, int,
2.10 Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();
2.11