Changeset 793:9cd0aeea47b0 in lemon-0.x for src/test/dfs_test.cc

Timestamp:

09/03/04 11:41:50 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

• BFD/DFS/Dijkstra compile test is done with skeleton::GraphSkeleton? graph and skeleton::ReadMap?.
• 'skeleton::' is explicitely written instead of 'using namespace ...' in graph_test.cc
• Output messages of type "makeRep(3)..." in unionfind_test.cc have been changed in order not to confuse compiler output parsers.

File:

• src/test/dfs_test.cc (modified) (3 diffs)

src/test/dfs_test.cc

@@ -2 +2 @@
 #include <hugo/smart_graph.h>
 #include <hugo/dfs.h>
+#include<hugo/skeletons/graph.h>
 
 using namespace hugo;
@@ -10 +11 @@
 void check_Dfs_SmartGraph_Compile() 
 {
-  typedef int VType;
-  typedef SmartGraph Graph;
+  typedef skeleton::StaticGraphSkeleton Graph;
 
   typedef Graph::Edge Edge;
@@ -17 +17 @@
   typedef Graph::EdgeIt EdgeIt;
   typedef Graph::NodeIt NodeIt;
-  typedef Graph::EdgeMap<VType> LengthMap;
  
-  typedef Dfs<Graph> BType;
+  typedef Dfs<Graph> DType;
   
   Graph G;
   Node n;
   Edge e;
-  VType l;
+  int l;
   bool b;
-  BType::DistMap d(G);
-  BType::PredMap p(G);
-  BType::PredNodeMap pn(G);
-  LengthMap cap(G);
+  DType::DistMap d(G);
+  DType::PredMap p(G);
+  DType::PredNodeMap pn(G);
   
-  BType dfs_test(G);
+  DType dfs_test(G);
   
   dfs_test.run(n);