[Boost-commit] svn:boost r51095 - trunk/libs/graph/test

Subject: [Boost-commit] svn:boost r51095 - trunk/libs/graph/test
From: asutton_at_[hidden]
Date: 2009-02-08 09:52:36

Author: asutton
Date: 2009-02-08 09:52:35 EST (Sun, 08 Feb 2009)
New Revision: 51095
URL: http://svn.boost.org/trac/boost/changeset/51095

Log:
Importing tests for all_cliques, all_cycles, and an eventual graph testing framework
Added:
   trunk/libs/graph/test/bron_kerbosch_all_cliques.cpp   (contents, props changed)
      - copied, changed from r51086, /sandbox/SOC/2007/graphs/libs/graph/test/runtime/bron_kerbosch_all_cliques.cpp
   trunk/libs/graph/test/tiernan_all_cycles.cpp   (contents, props changed)
      - copied, changed from r51086, /sandbox/SOC/2007/graphs/libs/graph/test/runtime/tiernan_all_cycles.cpp
Text files modified: 
   trunk/libs/graph/test/Jamfile.v2                    |     7 ++++++-                                 
   trunk/libs/graph/test/bron_kerbosch_all_cliques.cpp |     6 ++++--                                  
   trunk/libs/graph/test/test_graphs.cpp               |     1 -                                       
   trunk/libs/graph/test/tiernan_all_cycles.cpp        |     2 +-                                      
   4 files changed, 11 insertions(+), 5 deletions(-)

Modified: trunk/libs/graph/test/Jamfile.v2
==============================================================================
--- trunk/libs/graph/test/Jamfile.v2	(original)
+++ trunk/libs/graph/test/Jamfile.v2	2009-02-08 09:52:35 EST (Sun, 08 Feb 2009)
@@ -21,6 +21,10 @@
 }
 
 test-suite graph_test :
+    # test_graphs will eventually defined a framework for testing the structure
+    # and implementation of graph data structures and adaptors.
+    [ run test_graphs.cpp ]
+
     [ run transitive_closure_test.cpp ]
     [ compile adj_list_cc.cpp ]
 
@@ -93,8 +97,9 @@
     [ run is_straight_line_draw_test.cpp ]
     [ run metric_tsp_approx.cpp : metric_tsp_approx.txt ]
     [ compile dimacs.cpp ]
+    [ run bron_kerbosch_all_cliques.cpp ]
+    [ run tiernan_all_cycles.cpp ]
 
-    [ run test_graphs.cpp ]
     $(optional_tests)
     ;
 

Copied: trunk/libs/graph/test/bron_kerbosch_all_cliques.cpp (from r51086, /sandbox/SOC/2007/graphs/libs/graph/test/runtime/bron_kerbosch_all_cliques.cpp)
==============================================================================
--- /sandbox/SOC/2007/graphs/libs/graph/test/runtime/bron_kerbosch_all_cliques.cpp	(original)
+++ trunk/libs/graph/test/bron_kerbosch_all_cliques.cpp	2009-02-08 09:52:35 EST (Sun, 08 Feb 2009)
@@ -1,4 +1,4 @@
-// (C) Copyright Andrew Sutton 2007
+// (C) Copyright 2007-2009 Andrew Sutton
 //
 // Use, modification and distribution are subject to the
 // Boost Software License, Version 1.0 (See accompanying file
@@ -9,7 +9,6 @@
 #include <algorithm>
 #include <vector>
 #include <map>
-#include <tr1/unordered_map>
 
 #include <boost/graph/graph_utility.hpp>
 #include <boost/graph/undirected_graph.hpp>
@@ -22,6 +21,9 @@
 using namespace std;
 using namespace boost;
 
+// TODO: This is probably not a very good test. We should be able to define
+// an identity test - something like find the clique of K5.
+
 struct clique_validator
 {
     clique_validator()

Modified: trunk/libs/graph/test/test_graphs.cpp
==============================================================================
--- trunk/libs/graph/test/test_graphs.cpp	(original)
+++ trunk/libs/graph/test/test_graphs.cpp	2009-02-08 09:52:35 EST (Sun, 08 Feb 2009)
@@ -1,7 +1,6 @@
 
 #include <iostream>
 
-#include <boost/mpl/bool.hpp>
 #include <boost/graph/undirected_graph.hpp>
 #include <boost/graph/directed_graph.hpp>
 

Copied: trunk/libs/graph/test/tiernan_all_cycles.cpp (from r51086, /sandbox/SOC/2007/graphs/libs/graph/test/runtime/tiernan_all_cycles.cpp)
==============================================================================
--- /sandbox/SOC/2007/graphs/libs/graph/test/runtime/tiernan_all_cycles.cpp	(original)
+++ trunk/libs/graph/test/tiernan_all_cycles.cpp	2009-02-08 09:52:35 EST (Sun, 08 Feb 2009)
@@ -1,4 +1,4 @@
-// (C) Copyright Andrew Sutton 2007
+// (C) Copyright 2007-2009 Andrew Sutton
 //
 // Use, modification and distribution are subject to the
 // Boost Software License, Version 1.0 (See accompanying file