Mercuriallemon / comparison
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
test/edge_set_test.cc
changeset 1044 66156a3498ea
parent 491 68fe66e2b34a
child 956 141f9c0db4a3
child 1081 f1398882a928
child 1157 761fe0846f49
equal deleted inserted replaced
0:cac8ff5ec2ef 1:2ffc16c07960 
    31 #include "test_tools.h"
 
    31 #include "test_tools.h"
 
    32 
    32 
    33 using namespace lemon;
 
    33 using namespace lemon;
 
    34 
    34 
    35 void checkSmartArcSet() {
 
    35 void checkSmartArcSet() {
 
    36   checkConcept<concepts::Digraph, SmartArcSet<concepts::Digraph> >();
 
    36   checkConcept<concepts::Digraph, SmartArcSet<ListDigraph> >();
 
    37 
    37 
    38   typedef ListDigraph Digraph;
 
    38   typedef ListDigraph Digraph;
 
    39   typedef SmartArcSet<Digraph> ArcSet;
 
    39   typedef SmartArcSet<Digraph> ArcSet;
 
    40 
    40 
    41   Digraph digraph;
 
    41   Digraph digraph;
 
    97   digraph.erase(n1);
 
    97   digraph.erase(n1);
 
    98   check(!arc_set.valid(), "Wrong validity");
 
    98   check(!arc_set.valid(), "Wrong validity");
 
    99 }
 
    99 }
 
   100 
   100 
   101 void checkListArcSet() {
 
   101 void checkListArcSet() {
 
   102   checkConcept<concepts::Digraph, SmartArcSet<concepts::Digraph> >();
 
   102   checkConcept<concepts::Digraph, SmartArcSet<ListDigraph> >();
 
   103 
   103 
   104   typedef ListDigraph Digraph;
 
   104   typedef ListDigraph Digraph;
 
   105   typedef ListArcSet<Digraph> ArcSet;
 
   105   typedef ListArcSet<Digraph> ArcSet;
 
   106 
   106 
   107   Digraph digraph;
 
   107   Digraph digraph;
 
   177 
   177 
   178   checkGraphConArcList(arc_set, 2);
 
   178   checkGraphConArcList(arc_set, 2);
 
   179 }
 
   179 }
 
   180 
   180 
   181 void checkSmartEdgeSet() {
 
   181 void checkSmartEdgeSet() {
 
   182   checkConcept<concepts::Digraph, SmartEdgeSet<concepts::Digraph> >();
 
   182   checkConcept<concepts::Digraph, SmartEdgeSet<ListDigraph> >();
 
   183 
   183 
   184   typedef ListDigraph Digraph;
 
   184   typedef ListDigraph Digraph;
 
   185   typedef SmartEdgeSet<Digraph> EdgeSet;
 
   185   typedef SmartEdgeSet<Digraph> EdgeSet;
 
   186 
   186 
   187   Digraph digraph;
 
   187   Digraph digraph;
 
   261   digraph.erase(n1);
 
   261   digraph.erase(n1);
 
   262   check(!edge_set.valid(), "Wrong validity");
 
   262   check(!edge_set.valid(), "Wrong validity");
 
   263 }
 
   263 }
 
   264 
   264 
   265 void checkListEdgeSet() {
 
   265 void checkListEdgeSet() {
 
   266   checkConcept<concepts::Digraph, ListEdgeSet<concepts::Digraph> >();
 
   266   checkConcept<concepts::Digraph, ListEdgeSet<ListDigraph> >();
 
   267 
   267 
   268   typedef ListDigraph Digraph;
 
   268   typedef ListDigraph Digraph;
 
   269   typedef ListEdgeSet<Digraph> EdgeSet;
 
   269   typedef ListEdgeSet<Digraph> EdgeSet;
 
   270 
   270 
   271   Digraph digraph;
 
   271   Digraph digraph;
lemon