-
Notifications
You must be signed in to change notification settings - Fork 11
/
convertFileToBinary.cpp
116 lines (104 loc) · 4.36 KB
/
convertFileToBinary.cpp
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
// ***********************************************************************
//
// Grappolo: A C++ library for graph clustering
// Mahantesh Halappanavar (hala@pnnl.gov)
// Pacific Northwest National Laboratory
//
// ***********************************************************************
//
// Copyright (2014) Battelle Memorial Institute
// All rights reserved.
//
// 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.
//
// 3. Neither the name of the copyright holder nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// 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 "defs.h"
#include "input_output.h"
#include "basic_util.h"
using namespace std;
int main(int argc, char** argv) {
//Parse Input parameters:
clustering_parameters opts;
if (!opts.parse(argc, argv)) {
return -1;
}
int nT = 1; //Default is one thread
#pragma omp parallel
{
nT = omp_get_num_threads();
}
if (nT <= 1) {
//printf("The number of threads should be greater than one.\n");
//return 0;
}
graph* G = (graph *) malloc (sizeof(graph));
int fType = opts.ftype; //File type
char *inFile = (char*) opts.inFile;
switch (fType) {
case 1: parse_MatrixMarket_Sym_AsGraph(G, inFile); break;
case 2: parse_Dimacs9FormatDirectedNewD(G, inFile); break;
case 3: parse_PajekFormat(G, inFile); break;
case 4: parse_PajekFormatUndirected(G, inFile); break;
case 5: loadMetisFileFormat(G, inFile); break;
case 6: parse_UndirectedEdgeList(G, inFile); break;
//parse_UndirectedEdgeListDarpaHive(G, inFile); break;
case 7: printf("Not available\n"); exit(1); break; //parse_DirectedEdgeList(G, inFile); break;
case 8: parse_SNAP(G, inFile); break;
case 9: parse_EdgeListBinaryNew(G,inFile); break;
case 10:
#ifdef USEHDF5
//parse_EdgeListCompressedHDF5(G,inFile);
parse_EdgeListCompressedHDF5NoDuplicates(G,inFile);
#endif
break;
case 11: parse_UndirectedEdgeListFromJason(G, inFile); break;
case 12: parse_UndirectedEdgeListWeighted(G, inFile); break; // for John F's graphs
case 13: parse_UndirectedEdgeListDarpaHive(G, inFile); break;
case 14: parse_EdgeListFromGorder(G, inFile); break;
default: cout<<"A valid file type has not been specified"<<endl; exit(1);
}
displayGraphCharacteristics(G);
//displayGraph(G);
//Save file to binary:
char outFile[256];
sprintf(outFile,"%s.bin", opts.inFile);
printf("Graph will be stored in binary format in file: %s\n", outFile);
writeGraphBinaryFormatNew(G, outFile,1);
/* else
writeGraphBinaryFormat(G,outFile);
// writeGraphMetisSimpleFormat(G, outFile);
*/
//Cleanup:
if(G != 0) {
free(G->edgeListPtrs);
free(G->edgeList);
free(G);
}
return 0;
}//End of main()