src/test/graph_test.cc
changeset 919 6153d9cf78c6
parent 909 6a22e0dfd453
child 921 818510fa3d99
equal deleted inserted replaced
21:76212c0c3349 22:c2efc975f4a3
    61   checkGraphEdgeList(G,30);
    61   checkGraphEdgeList(G,30);
    62 
    62 
    63   for(NodeIt n(G);n!=INVALID;++n) {
    63   for(NodeIt n(G);n!=INVALID;++n) {
    64     checkGraphInEdgeList(G,n,3);
    64     checkGraphInEdgeList(G,n,3);
    65     checkGraphOutEdgeList(G,n,3);
    65     checkGraphOutEdgeList(G,n,3);
       
    66     ++n;
    66   }  
    67   }  
    67 }
    68 }
    68 
    69 
    69 //Compile Graph
    70 //Compile Graph
    70 template void hugo::checkCompileStaticGraph<skeleton::StaticGraph>
    71 template void hugo::checkCompileStaticGraph<skeleton::StaticGraph>
    79 //Compile SmartGraph
    80 //Compile SmartGraph
    80 template void hugo::checkCompileGraph<SmartGraph>(SmartGraph &);
    81 template void hugo::checkCompileGraph<SmartGraph>(SmartGraph &);
    81 template void hugo::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
    82 template void hugo::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
    82 
    83 
    83 //Compile SymSmartGraph
    84 //Compile SymSmartGraph
    84 //template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
    85 template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
    85 //template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
    86 template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
    86 
    87 
    87 //Compile ListGraph
    88 //Compile ListGraph
    88 template void hugo::checkCompileGraph<ListGraph>(ListGraph &);
    89 template void hugo::checkCompileGraph<ListGraph>(ListGraph &);
    89 template void hugo::checkCompileErasableGraph<ListGraph>(ListGraph &);
    90 template void hugo::checkCompileErasableGraph<ListGraph>(ListGraph &);
    90 template void hugo::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
    91 template void hugo::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
    91 
    92 
    92 
    93 
    93 //Compile SymListGraph
    94 //Compile SymListGraph
    94 //template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
    95 template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
    95 //template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
    96 template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
    96 //template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
    97 template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
    97 
    98 
    98 //Compile FullGraph
    99 //Compile FullGraph
    99 template void hugo::checkCompileStaticGraph<FullGraph>(FullGraph &);
   100 template void hugo::checkCompileStaticGraph<FullGraph>(FullGraph &);
   100 template void hugo::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
   101 template void hugo::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
   101 
   102 
   128     addPetersen(G);
   129     addPetersen(G);
   129     bidirPetersen(G);
   130     bidirPetersen(G);
   130     checkPetersen(G);
   131     checkPetersen(G);
   131   }
   132   }
   132   {
   133   {
   133     //    SymSmartGraph G;
   134     SymSmartGraph G;
   134     //    addPetersen(G);
   135     addPetersen(G);
   135     //    checkPetersen(G);
   136     checkPetersen(G);
   136   }
   137   }
   137   {
   138   {
   138     //    SymListGraph G;
   139     SymListGraph G;
   139     //    addPetersen(G);
   140     addPetersen(G);
   140     //    checkPetersen(G);
   141     checkPetersen(G);
   141   }
   142   }
   142 
   143 
   143   ///\file
   144   ///\file
   144   ///\todo map tests.
   145   ///\todo map tests.
   145   ///\todo copy constr tests.
   146   ///\todo copy constr tests.