Changeset 209:765619b7cbb2 in lemon-main for test/dfs_test.cc

Timestamp:

07/13/08 20:51:02 (17 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Phase:

public

Message:

Apply unify-sources.sh to the source tree

File:

• test/dfs_test.cc (modified) (9 diffs)

test/dfs_test.cc

@@ -1 @@
-/* -*- C++ -*-
+/* -*- mode: C++; indent-tabs-mode: nil; -*-
  *
- * This file is a part of LEMON, a generic C++ optimization library
+ * This file is a part of LEMON, a generic C++ optimization library.
  *
  * Copyright (C) 2003-2008
@@ -28 +28 @@
 using namespace lemon;
 
-void checkDfsCompile() 
+void checkDfsCompile()
 {
   typedef concepts::Digraph Digraph;
   typedef Dfs<Digraph> DType;
-  
+
   Digraph G;
   Digraph::Node n;
@@ -41 +41 @@
   DType::PredMap p(G);
   //  DType::PredNodeMap pn(G);
-  
+
   DType dfs_test(G);
-  
+
   dfs_test.run(n);
-  
+
   l  = dfs_test.dist(n);
   e  = dfs_test.predArc(n);
@@ -57 +57 @@
 }
 
-void checkDfsFunctionCompile() 
+void checkDfsFunctionCompile()
 {
   typedef int VType;
@@ -63 +63 @@
   typedef Digraph::Arc Arc;
   typedef Digraph::Node Node;
-   
+
   Digraph g;
   dfs(g,Node()).run();
@@ -72 +72 @@
     .reachedMap(concepts::ReadWriteMap<Node,bool>())
     .processedMap(concepts::WriteMap<Node,bool>())
-    .run(Node()); 
+    .run(Node());
 }
 
@@ -82 +82 @@
   Node s, t;
   PetStruct<Digraph> ps = addPetersen(G, 5);
-   
+
   s=ps.outer[2];
   t=ps.inner[0];
-  
+
   Dfs<Digraph> dfs_test(G);
-  dfs_test.run(s);  
-  
+  dfs_test.run(s);
+
   Path<Digraph> p = dfs_test.path(t);
   check(p.length() == dfs_test.dist(t),"path() found a wrong path.");
@@ -94 +94 @@
   check(pathSource(G, p) == s,"path() found a wrong path.");
   check(pathTarget(G, p) == t,"path() found a wrong path.");
-  
+
   for(NodeIt v(G); v!=INVALID; ++v) {
     check(dfs_test.reached(v),"Each node should be reached.");
@@ -102 +102 @@
       check(u==dfs_test.predNode(v),"Wrong tree.");
       check(dfs_test.dist(v) - dfs_test.dist(u) == 1,
-            "Wrong distance. (" << dfs_test.dist(u) << "->" 
-            <<dfs_test.dist(v) << ')');
+            "Wrong distance. (" << dfs_test.dist(u) << "->"
+            <<dfs_test.dist(v) << ')');
     }
   }