OpenFPM  5.2.0
Project that contain the implementation of distributed structures
GraphMLWriter_unit_tests.hpp
1 /*
2  * GraphMLWriter_unit_tests.hpp
3  *
4  * Created on: Dec 9, 2014
5  * Author: i-bird
6  */
7 
8 #ifndef GRAPHMLWRITER_UNIT_TESTS_HPP_
9 #define GRAPHMLWRITER_UNIT_TESTS_HPP_
10 
11 #define GS_SIZE 8
12 
13 #include "GraphMLWriter.hpp"
14 #include "Graph/CartesianGraphFactory.hpp"
15 #include "util/util.hpp"
16 
17 BOOST_AUTO_TEST_SUITE( graphml_writer_test )
18 
19 
25 struct ne_cp
26 {
28  typedef boost::fusion::vector<float,float,float,double,long int,int,std::string> type;
29 
32 
34  static const unsigned int x = 0;
36  static const unsigned int y = 1;
38  static const unsigned int z = 2;
40  static const unsigned int double_num = 3;
42  static const unsigned int long_num = 4;
44  static const unsigned int integer = 5;
46  static const unsigned int string = 6;
48  static const unsigned int max_prop = 7;
49 
51  float & get_x() {return boost::fusion::at_c<x>(data);}
53  float & get_y() {return boost::fusion::at_c<y>(data);}
55  float & get_z() {return boost::fusion::at_c<z>(data);}
57  double & get_dn() {return boost::fusion::at_c<double_num>(data);}
59  long int & get_ln() {return boost::fusion::at_c<long_num>(data);}
61  int & get_i() {return boost::fusion::at_c<integer>(data);}
63  std::string & get_str() {return boost::fusion::at_c<string>(data);}
64 
66  struct attributes
67  {
68  static const std::string name[max_prop];
69  };
70 
71  static inline bool noPointers()
72  {
73  return true;
74  }
75 
77  typedef float s_type;
78 };
79 
80 // Initialize the attributes strings array
81 const std::string ne_cp::attributes::name[] = {"x","y","z","double_num","long_num","integer","string"};
82 
83 BOOST_AUTO_TEST_CASE( graphml_writer_use)
84 {
85  Vcluster<> & v_cl = create_vcluster();
86 
87  if (v_cl.getProcessUnitID() != 0)
88  return;
89 
90  std::string c2 = std::string("test_data/test_graph2_test.graphml");
91  std::string c3 = std::string("test_data/test_graph_test.graphml");
92 
94 
95  // Add 4 vertex and connect
96 
97  struct ne_cp n1;
98  n1.get_x() = 1.0;
99  n1.get_y() = 2.0;
100  n1.get_z() = 3.0;
101  n1.get_dn() = 4.0;
102  n1.get_ln() = 5.0;
103  n1.get_i() = 6.0;
104  n1.get_str() = std::string("test");
105  g_csr2.addVertex(n1);
106  n1.get_str() = std::string("tes2");
107  g_csr2.addVertex(n1);
108  n1.get_str() = std::string("test3");
109  g_csr2.addVertex(n1);
110  n1.get_str() = std::string("test4");
111  g_csr2.addVertex(n1);
112  n1.get_str() = std::string("test5");
113 
114  g_csr2.addEdge(0,1,n1);
115  n1.get_str() = std::string("test6");
116  g_csr2.addEdge(2,1,n1);
117  n1.get_str() = std::string("test7");
118  g_csr2.addEdge(3,1,n1);
119  n1.get_str() = std::string("test8");
120  g_csr2.addEdge(2,0,n1);
121  n1.get_str() = std::string("test9");
122  g_csr2.addEdge(3,2,n1);
123 
124  // Create a graph ML
126  gv2.write("test_graph2.graphml");
127 
128  // check that match
129 
130  bool test = compare("test_graph2.graphml",c2);
131  BOOST_REQUIRE_EQUAL(true,test);
132 
134 
136 
137  // Cartesian grid
138  size_t sz[] = {GS_SIZE,GS_SIZE,GS_SIZE};
139 
140  // Box
141  Box<3,float> box({0.0,0.0,0.0},{1.0,1.0,1.0});
142 
143  // Boundary conditions, non periodic
144  size_t bc[] = {NON_PERIODIC,NON_PERIODIC,NON_PERIODIC};
145 
146  Graph_CSR<ne_cp,ne_cp> g_csr = g_factory.construct<5,NO_VERTEX_ID,float,2,ne_cp::x,ne_cp::y,ne_cp::z>(sz,box,bc);
147 
148  // Create a graph ML
150  gw.write("test_graph.graphml");
151 
152 
153  // check that match
154  test = compare("test_graph.graphml",c3);
155  BOOST_REQUIRE_EQUAL(true,test);
156 }
157 
158 BOOST_AUTO_TEST_SUITE_END()
159 
160 
161 #endif /* GRAPHMLWRITER_UNIT_TESTS_HPP_ */
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.
Definition: map_graph.hpp:305
void addVertex(const V &vrt)
add vertex
Definition: map_graph.hpp:860
auto addEdge(size_t v1, size_t v2, const E &ed) -> decltype(e.get(0))
add edge on the graph
Definition: map_graph.hpp:900
size_t getProcessUnitID()
Get the process unit id.
Implementation of VCluster class.
Definition: VCluster.hpp:59
define attributes names
float & get_z()
get z
float & get_x()
get x
boost::fusion::vector< float, float, float, double, long int, int, std::string > type
The node contain several properties.
float & get_y()
get y
std::string & get_str()
get string
type data
The data.
static const unsigned int x
x property id in boost::fusion::vector
static const unsigned int y
y property id in boost::fusion::vector
float s_type
type of the spatial information
int & get_i()
get integer
static const unsigned int z
z property id in boost::fusion::vector
long int & get_ln()
get long number
double & get_dn()
get double number