1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
/* Copyright (C) 2010 Imperial College London and others.
*
* Please see the AUTHORS file in the main source directory for a
* full list of copyright holders.
*
* Gerard Gorman
* Applied Modelling and Computation Group
* Department of Earth Science and Engineering
* Imperial College London
*
* g.gorman@imperial.ac.uk
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
* TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <cassert>
#ifdef _OPENMP
#include <omp.h>
#endif
#ifdef HAVE_MPI
#include <mpi.h>
#endif
#include <vector>
#include <set>
#include <iostream>
#include <vtkUnstructuredGrid.h>
#include <vtkXMLUnstructuredGridReader.h>
#include <vtkCell.h>
#include "zoltan_tools.h"
int main(int argc, char **argv){
MPI::Init(argc,argv);
int rank = 0;
if(MPI::Is_initialized()){
rank = MPI::COMM_WORLD.Get_rank();
}
assert(MPI::COMM_WORLD.Get_size()==1);
const char filename[]="../data/box10x10x10.vtu";
vtkXMLUnstructuredGridReader *reader = vtkXMLUnstructuredGridReader::New();
reader->SetFileName(filename);
reader->Update();
vtkUnstructuredGrid *ug = reader->GetOutput();
size_t NElements = ug->GetNumberOfCells();
std::vector<int> ENList(NElements*4);
for(size_t i=0;i<NElements;i++){
vtkCell *cell = ug->GetCell(i);
assert(cell->GetNumberOfPoints()==4);
for(int j=0;j<4;j++){
ENList[i*4+j] = cell->GetPointId(j);
}
}
size_t NNodes = ug->GetNumberOfPoints();
reader->Delete();
// Graph
std::vector< std::set<int> > graph_ragged(NNodes);
for(size_t i=0;i<NElements;i++){
for(int j=0;j<4;j++){
for(int k=0;k<4;k++){
graph_ragged[ENList[i*4+j]].insert(ENList[i*4+k]);
}
}
}
// Colour.
zoltan_graph_t graph;
std::vector<int> colour(NNodes);
graph.colour = &(colour[0]);
graph.rank = rank;
graph.nnodes = NNodes;
graph.npnodes = NNodes;
std::vector<size_t> nedges(NNodes);
size_t sum = 0;
for(size_t i=0;i<NNodes;i++){
size_t cnt = 0;
cnt = graph_ragged[i].size();
nedges[i] = cnt;
sum+=cnt;
}
graph.nedges = &(nedges[0]);
std::vector<size_t> csr_edges(sum);
sum=0;
for(size_t i=0;i<NNodes;i++){
for(std::set<int>::iterator it=graph_ragged[i].begin();it!=graph_ragged[i].end();++it){
csr_edges[sum++] = *it;
}
}
graph.csr_edges = &(csr_edges[0]);
std::vector<int> lnn2gnn(NNodes);
std::vector<int> owner(NNodes, 0);
for(size_t i=0;i<NNodes;i++){
lnn2gnn[i] = i;
}
graph.gid = &(lnn2gnn[0]);
graph.owner = &(owner[0]);
zoltan_colour(&graph, 1, MPI_COMM_WORLD);
zoltan_colour(&graph, 1, MPI_COMM_WORLD);
MPI::Finalize();
std::cout<<"pass\n";
return 0;
}
|