8#ifndef METIS_UTIL_UNIT_TEST_HPP_
9#define METIS_UTIL_UNIT_TEST_HPP_
11#include "Graph/CartesianGraphFactory.hpp"
12#include "Graph/map_graph.hpp"
13#include "metis_util.hpp"
24BOOST_AUTO_TEST_SUITE( Metis_test )
26BOOST_AUTO_TEST_CASE( Metis_test_use)
40 size_t sz[3] = {GS_SIZE,GS_SIZE,GS_SIZE};
46 size_t bc[] = {NON_PERIODIC,NON_PERIODIC,NON_PERIODIC};
61 met.decompose<nm_v_proc_id>();
66 vtk.write(
"vtk_metis_util_gp.vtk");
69 vtk2.write(
"vtk_metis_util_g.vtk");
74 bool test = compare(
"vtk_metis_util_gp.vtk",
"src/Decomposition/Distribution/test_data/vtk_metis_util_gp_osx_test.vtk");
75 bool test2 = compare(
"vtk_metis_util_g.vtk",
"src/Decomposition/Distribution/test_data/vtk_metis_util_g_osx_test.vtk");
77 bool test = compare(
"vtk_metis_util_gp.vtk",
"src/Decomposition/Distribution/test_data/vtk_metis_util_gp_test.vtk");
78 bool test2 = compare(
"vtk_metis_util_g.vtk",
"src/Decomposition/Distribution/test_data/vtk_metis_util_g_test.vtk");
84 BOOST_REQUIRE_EQUAL(
true,test);
85 BOOST_REQUIRE_EQUAL(
true,test2);
89BOOST_AUTO_TEST_SUITE_END()
This class represent an N-dimensional box.
This class construct a cartesian graph.
static Graph construct(const size_t(&sz)[dim], Box< dim, T > &dom, const size_t(&bc)[dim])
Construct a cartesian graph, with V and E edge properties.
Structure that store a graph in CSR format or basically in compressed adjacency matrix format.
Helper class to define Metis graph.
size_t getProcessUnitID()
Get the process unit id.
size_t getProcessingUnits()
Get the total number of processors.
Implementation of VCluster class.
sub-domain edge graph node
static const unsigned int communication
computation property id in boost::fusion::vector
static const unsigned int id
partition id in the boost::fusion::vector