Add another test.

git-svn-id: https://svn.dealii.org/trunk@31573 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/tests/base/graph_coloring_02a.cc b/tests/base/graph_coloring_02a.cc
new file mode 100644 (file)
index 0000000..274aa39
--- /dev/null
+++ b/tests/base/graph_coloring_02a.cc
@@ -0,0 +1,121 @@
+// ---------------------------------------------------------------------
+// $Id: graph_coloring_02.cc 30045 2013-07-18 19:18:00Z maier $
+//
+// Copyright (C) 2003 - 2013 by the deal.II authors
+//
+// This file is part of the deal.II library.
+//
+// The deal.II library is free software; you can use it, redistribute
+// it, and/or modify it under the terms of the GNU Lesser General
+// Public License as published by the Free Software Foundation; either
+// version 2.1 of the License, or (at your option) any later version.
+// The full text of the license can be found in the file LICENSE at
+// the top level of the deal.II distribution.
+//
+// ---------------------------------------------------------------------
+
+
+
+// Like _02, but verify that the elements in each partition really do
+// not conflict
+
+
+#include "../tests.h"
+#include <fstream>
+#include <vector>
+
+#include <deal.II/base/graph_coloring.h>
+#include <deal.II/dofs/dof_accessor.h>
+#include <deal.II/dofs/dof_handler.h>
+#include <deal.II/fe/fe_q.h>
+#include <deal.II/grid/grid_generator.h>
+#include <deal.II/grid/tria_accessor.h>
+#include <deal.II/grid/tria_iterator.h>
+#include <deal.II/grid/tria.h>
+
+template <int dim>
+std::vector<types::global_dof_index> get_conflict_indices_cfem(
+    typename DoFHandler<dim>::active_cell_iterator const &it)
+{
+  std::vector<types::global_dof_index> local_dof_indices(it->get_fe().dofs_per_cell);
+  it->get_dof_indices(local_dof_indices);
+
+  return local_dof_indices;
+}
+
+template <int dim>
+void check()
+{
+  // Create the Triangulation and the DoFHandler
+  Triangulation<dim> triangulation;
+  GridGenerator::hyper_cube(triangulation);
+  triangulation.refine_global(2);
+  FE_Q<dim> fe(2);
+  DoFHandler<dim> dof_handler(triangulation);
+  dof_handler.distribute_dofs(fe);
+
+  // Create an adapted mesh
+  typename DoFHandler<dim>::active_cell_iterator
+  cell = dof_handler.begin_active();
+  for (; cell<dof_handler.end(); ++cell)
+  {
+    if ((cell->center()[0]==0.625)
+       &&
+       ((dim < 2) || (cell->center()[1]==0.625))
+       &&
+       ((dim < 3) || (cell->center()[2]==0.625)))
+    cell->set_refine_flag();
+  }
+  triangulation.execute_coarsening_and_refinement();
+  dof_handler.distribute_dofs(fe);
+
+  // Create the coloring
+  std::vector<std::vector<typename DoFHandler<dim>::active_cell_iterator> > coloring(
+      graph_coloring::make_graph_coloring(dof_handler.begin_active(),dof_handler.end(),
+        std_cxx1x::function<std::vector<types::global_dof_index> (typename
+          DoFHandler<dim>::active_cell_iterator const &)> (&get_conflict_indices_cfem<dim>)));
+
+  // verify that within each color, there is no conflict
+  for (unsigned int color=0; color<coloring.size(); ++color)
+    for (unsigned int i=0; i<coloring[color].size(); ++i)
+      {
+       std::vector<types::global_dof_index>
+         conflicts_i = get_conflict_indices_cfem<dim> (coloring[color][i]);
+       std::sort (conflicts_i.begin(), conflicts_i.end());
+
+       for (unsigned int j=i+1; j<coloring[color].size(); ++j)
+         {
+           std::vector<types::global_dof_index>
+             conflicts_j = get_conflict_indices_cfem<dim> (coloring[color][j]);
+           std::sort (conflicts_j.begin(), conflicts_j.end());
+
+           // compute intersection of index sets
+           std::vector<types::global_dof_index>
+             intersection (std::max (conflicts_i.size(), conflicts_j.size()));
+           std::vector<types::global_dof_index>::iterator
+             p = std::set_intersection (conflicts_i.begin(), conflicts_i.end(),
+                                        conflicts_j.begin(), conflicts_j.end(),
+                                        intersection.begin());
+           // verify that there is no intersection
+           Assert (p == intersection.begin(),
+                   ExcInternalError());
+         }
+      }
+
+  deallog << "OK" << std::endl;
+}
+
+int main()
+{
+  std::ofstream logfile("output");
+  deallog<<std::setprecision(4);
+  deallog<<std::fixed;
+  deallog.attach(logfile);
+  deallog.depth_console(0);
+
+  check<1> ();
+  check<2> ();
+  check<3> ();
+
+  return 0;
+}

diff --git a/tests/base/graph_coloring_02a.output b/tests/base/graph_coloring_02a.output
new file mode 100644 (file)
index 0000000..fb71de2
--- /dev/null
+++ b/tests/base/graph_coloring_02a.output
@@ -0,0 +1,4 @@
+
+DEAL::OK
+DEAL::OK
+DEAL::OK