Changeset 1160:d9c32f713cad in lemon0.x for src
 Timestamp:
 02/21/05 10:28:00 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1561
 Location:
 src
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

src/lemon/graph_wrapper.h
r1135 r1160 1038 1038 1039 1039 1040 /// \brief A bidirected graph template.1041 ///1042 ///\warning Graph wrappers are in even more experimental state than the other1043 ///parts of the lib. Use them at you own risk.1044 ///1045 /// A bidirected graph template.1046 /// Such a bidirected graph stores each pair of oppositely directed edges1047 /// ones in the memory, i.e. a directed graph of type1048 /// \c Graph is used for that.1049 /// As the oppositely directed edges are logically different ones1050 /// the maps are able to attach different values for them.1051 /// \ingroup graphs1052 template<typename Graph>1053 class BidirGraph : public BidirGraphWrapper<Graph> {1054 public:1055 typedef UndirGraphWrapper<Graph> Parent;1056 protected:1057 Graph gr;1058 public:1059 BidirGraph() : BidirGraphWrapper<Graph>() {1060 Parent::setGraph(gr);1061 }1062 // KEEP_MAPS(Parent, BidirGraph);1063 };1064 1065 1066 1067 1040 template<typename Graph, typename Number, 1068 1041 typename CapacityMap, typename FlowMap> 
src/test/graph_wrapper_test.cc
r998 r1160 57 57 checkConcept<StaticGraph, SubBidirGraphWrapper<Graph, 58 58 Graph::EdgeMap<bool>, Graph::EdgeMap<bool> > >(); 59 checkConcept<StaticGraph, BidirGraph<Graph> >();59 // checkConcept<StaticGraph, BidirGraph<Graph> >(); 60 60 checkConcept<StaticGraph, ResGraphWrapper<Graph, int, 61 61 Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();
Note: See TracChangeset
for help on using the changeset viewer.