Ticket #8317: 0001-Add-tests-for-edge-coloring.patch

libs/graph/test/Jamfile.v2

@@ -131 +131 @@
     [ run hawick_circuits.cpp ]
     [ run successive_shortest_path_nonnegative_weights_test.cpp ../../test/build//boost_unit_test_framework/<link>static ]
     [ run cycle_canceling_test.cpp ../../test/build//boost_unit_test_framework/<link>static ]
+    [ run edge_coloring.cpp ]
     ;
 
 # Run SDB tests only when -sSDB= is set.

new file libs/graph/test/edge_coloring.cpp

@@ +1 @@
+//=======================================================================
+// Copyright 2013 Maciej Piechotka
+// Authors: Maciej Piechotka
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+//=======================================================================
+
+#include <boost/config.hpp>
+#include <boost/test/minimal.hpp>
+
+#include <boost/dynamic_bitset.hpp>
+#include <boost/graph/adjacency_list.hpp>
+#include <boost/graph/random.hpp>
+#include <boost/graph/edge_coloring.hpp>
+#include <boost/random/mersenne_twister.hpp>
+
+template<typename Graph, typename ColorMap>
+void test_graph(Graph &graph, ColorMap color)
+{
+  typedef typename boost::property_traits<ColorMap>::value_type color_t;
+  color_t colors_no = boost::edge_coloring(graph, color);
+  BGL_FORALL_VERTICES_T(v, graph, Graph) {
+    boost::dynamic_bitset<> used_colors(colors_no);
+    BGL_FORALL_OUTEDGES_T(v, e, graph, Graph) {
+      BOOST_CHECK(!used_colors.test(get(color, e)));
+      used_colors.set(get(color, e));
+    }
+  }
+}
+
+// usage: edge_coloring.exe [vertices=100] [edges=5*vertices]
+
+int test_main(int argc, char* argv[])
+{
+  size_t vertices = 100;
+  if (argc > 1) {
+    vertices = atoi(argv[1]);
+  }
+  size_t edges = 5 * vertices;
+  if (argc > 2) {
+    edges = atoi(argv[2]);
+  }
+  using namespace boost;
+  typedef adjacency_list<vecS, vecS, undirectedS, no_property, size_t, no_property> Graph;
+  Graph G;
+  boost::mt19937 gen;
+  generate_random_graph(G, vertices, edges, gen, false, false);
+  test_graph(G, get(edge_bundle, G));
+  return 0;
+}