Skip to content
Navigation Menu
{{ message }}
forked from GraphChi/graphchi-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconversions.hpp
More file actions
795 lines (662 loc) · 29.6 KB
/
Copy pathconversions.hpp
File metadata and controls
795 lines (662 loc) · 29.6 KB
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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
;/**
* @file
* @author Aapo Kyrola <akyrola@cs.cmu.edu>
* @version 1.0
*
* @section LICENSE
*
* Copyright [2012] [Aapo Kyrola, Guy Blelloch, Carlos Guestrin / Carnegie Mellon University]
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* @section DESCRIPTION
*
* Graph conversion and parsing routines.
*/
#ifndef GRAPHCHI_CONVERSIONS_DEF
#define GRAPHCHI_CONVERSIONS_DEF
#include <fcntl.h>
#include <unistd.h>
#include <sys/types.h>
#include <dirent.h>
#include <sys/stat.h>
#include <fstream>
#include <iostream>
#include "graphchi_types.hpp"
#include "logger/logger.hpp"
#include "preprocessing/sharder.hpp"
/**
* GNU COMPILER HACK TO PREVENT WARNINGS "Unused variable", if
* the particular app being compiled does not use a function.
*/
#ifdef __GNUC__
#define VARIABLE_IS_NOT_USED __attribute__ ((unused))
#else
#define VARIABLE_IS_NOT_USED
#endif
namespace graphchi {
struct dummy {
};
template <typename T>
struct dummyC {
operator T() { return T(); }
};
/* Simple string to number parsers */
static void VARIABLE_IS_NOT_USED parse(int &x, const char * s);
static void VARIABLE_IS_NOT_USED parse(unsigned int &x, const char * s);
static void VARIABLE_IS_NOT_USED parse(float &x, const char * s);
static void VARIABLE_IS_NOT_USED parse(long &x, const char * s);
static void VARIABLE_IS_NOT_USED parse(char &x, const char * s);
static void VARIABLE_IS_NOT_USED parse(bool &x, const char * s);
static void VARIABLE_IS_NOT_USED parse(double &x, const char * s);
static void VARIABLE_IS_NOT_USED parse(short &x, const char * s);
static void FIXLINE(char * s);
static void parse(int &x, const char * s) {
x = atoi(s);
}
static void parse(unsigned int &x, const char * s) {
x = (unsigned int) strtoul(s, NULL, 10);
}
static void parse(float &x, const char * s) {
x = (float) atof(s);
}
static void parse(dummy &x, const char *s) {}
/**
* Special templated parser for PairContainers.
*/
template <typename T>
void parse(PairContainer<T> &x, const char * s) {
parse(x.left, s);
parse(x.right, s);
}
static void parse(long &x, const char * s) {
x = atol(s);
}
static void parse(char &x, const char * s) {
x = s[0];
}
static void parse(bool &x, const char * s) {
x = atoi(s) == 1;
}
static void parse(double &x, const char * s) {
x = atof(s);
}
static void parse(short &x, const char * s) {
x = (short) atoi(s);
}
#ifdef DYNAMICEDATA
static void VARIABLE_IS_NOT_USED parse_multiple(std::vector<dummy> &values, char * s);
static void VARIABLE_IS_NOT_USED parse_multiple(std::vector<dummy> & values, char * s) {
assert(false);
}
/**
* Parse ':' -delimited values into a vector.
*/
template <typename T>
static void parse_multiple(typename std::vector<T> & values, char * s) {
char delims[] = ":";
char * t;
t = strtok(s, delims);
T x;
parse(x, (const char*) t);
values.push_back(x);
while((t = strtok(NULL, delims)) != NULL) {
parse(x, (const char*) t);
values.push_back(x);
}
}
#endif
// Catch all
template <typename T>
void parse(T &x, const char * s) {
logstream(LOG_FATAL) << "You need to define parse<your-type>(your-type &x, const char *s) function"
<< " to support parsing the edge value." << std::endl;
assert(false);
}
// Removes \n from the end of line
inline void FIXLINE(char * s) {
int len = (int) strlen(s)-1;
if(s[len] == '\n') s[len] = 0;
}
// http://www.linuxquestions.org/questions/programming-9/c-list-files-in-directory-379323/
static int VARIABLE_IS_NOT_USED getdir (std::string dir, std::vector<std::string> &files);
static int VARIABLE_IS_NOT_USED getdir (std::string dir, std::vector<std::string> &files)
{
DIR *dp;
struct dirent *dirp;
if((dp = opendir(dir.c_str())) == NULL) {
std::cout << "Error(" << errno << ") opening " << dir << std::endl;
return errno;
}
while ((dirp = readdir(dp)) != NULL) {
files.push_back(std::string(dirp->d_name));
}
closedir(dp);
return 0;
}
static VARIABLE_IS_NOT_USED std::string get_dirname(std::string arg);
static VARIABLE_IS_NOT_USED std::string get_dirname(std::string arg) {
size_t a = arg.find_last_of("/");
if (a != arg.npos) {
std::string dir = arg.substr(0, a);
return dir;
} else {
assert(false);
return "n/a";
}
}
static std::string VARIABLE_IS_NOT_USED get_filename(std::string arg);
static std::string VARIABLE_IS_NOT_USED get_filename(std::string arg) {
size_t a = arg.find_last_of("/");
if (a != arg.npos) {
std::string f = arg.substr(a + 1);
return f;
} else {
assert(false);
return "n/a";
}
}
/**
* Converts graph from an edge list format. Input may contain
* value for the edges. Self-edges are ignored.
*/
template <typename EdgeDataType, typename FinalEdgeDataType>
void convert_edgelist(std::string inputfile, sharder<EdgeDataType, FinalEdgeDataType> &sharderobj, bool multivalue_edges=false) {
FILE * inf = fopen(inputfile.c_str(), "r");
size_t bytesread = 0;
size_t linenum = 0;
if (inf == NULL) {
logstream(LOG_FATAL) << "Could not load :" << inputfile << " error: " << strerror(errno) << std::endl;
}
assert(inf != NULL);
logstream(LOG_INFO) << "Reading in edge list format!" << std::endl;
char s[1024];
while(fgets(s, 1024, inf) != NULL) {
linenum++;
if (linenum % 10000000 == 0) {
logstream(LOG_DEBUG) << "Read " << linenum << " lines, " << bytesread / 1024 / 1024. << " MB" << std::endl;
}
FIXLINE(s);
bytesread += strlen(s);
if (s[0] == '#') continue; // Comment
if (s[0] == '%') continue; // Comment
char delims[] = "\t, ";
char * t;
t = strtok(s, delims);
if (t == NULL) {
logstream(LOG_ERROR) << "Input file is not in right format. "
<< "Expecting \"<from>\t<to>\". "
<< "Current line: \"" << s << "\"\n";
assert(false);
}
vid_t from = atoi(t);
t = strtok(NULL, delims);
if (t == NULL) {
logstream(LOG_ERROR) << "Input file is not in right format. "
<< "Expecting \"<from>\t<to>\". "
<< "Current line: \"" << s << "\"\n";
assert(false);
}
vid_t to = atoi(t);
/* Check if has value */
t = strtok(NULL, delims);
if (!multivalue_edges) {
EdgeDataType val;
if (t != NULL) {
parse(val, (const char*) t);
}
if (from != to) {
if (t != NULL) {
sharderobj.preprocessing_add_edge(from, to, val);
} else {
sharderobj.preprocessing_add_edge(from, to);
}
}
} else {
#ifdef DYNAMICEDATA
std::vector<EdgeDataType> vals;
parse_multiple(vals, (char*) t);
if (from != to) {
if (vals.size() == 0) {
// TODO: go around this problem
logstream(LOG_FATAL) << "Each edge needs at least one value." << std::endl;
assert(vals.size() > 0);
}
sharderobj.preprocessing_add_edge_multival(from, to, vals);
}
#else
logstream(LOG_FATAL) << "To support multivalue-edges, dynamic edge data needs to be used." << std::endl;
assert(false);
#endif
}
}
fclose(inf);
}
/**
* Converts a graph from adjacency list format. Edge values are not supported,
* and each edge gets the default value for the type. Self-edges are ignored.
*/
template <typename EdgeDataType, typename FinalEdgeDataType>
void convert_adjlist(std::string inputfile, sharder<EdgeDataType, FinalEdgeDataType> &sharderobj) {
FILE * inf = fopen(inputfile.c_str(), "r");
if (inf == NULL) {
logstream(LOG_FATAL) << "Could not load :" << inputfile << " error: " << strerror(errno) << std::endl;
}
assert(inf != NULL);
logstream(LOG_INFO) << "Reading in adjacency list format!" << std::endl;
int maxlen = 100000000;
char * s = (char*) malloc(maxlen);
size_t bytesread = 0;
char delims[] = " \t";
size_t linenum = 0;
size_t lastlog = 0;
/*** PHASE 1 - count ***/
while(fgets(s, maxlen, inf) != NULL) {
linenum++;
if (bytesread - lastlog >= 500000000) {
logstream(LOG_DEBUG) << "Read " << linenum << " lines, " << bytesread / 1024 / 1024. << " MB" << std::endl;
lastlog = bytesread;
}
FIXLINE(s);
bytesread += strlen(s);
if (s[0] == '#') continue; // Comment
if (s[0] == '%') continue; // Comment
char * t = strtok(s, delims);
vid_t from = atoi(t);
t = strtok(NULL,delims);
if (t != NULL) {
vid_t num = atoi(t);
vid_t i = 0;
while((t = strtok(NULL,delims)) != NULL) {
vid_t to = atoi(t);
if (from != to) {
sharderobj.preprocessing_add_edge(from, to, EdgeDataType());
}
i++;
}
if (num != i) {
logstream(LOG_ERROR) << "Mismatch when reading adjacency list: " << num << " != " << i << " s: " << std::string(s)
<< " on line: " << linenum << std::endl;
continue;
}
}
}
free(s);
fclose(inf);
}
/**
* Extract a vector of node indices from a line in the file.
*
* @param[in] line line from input file containing node indices
* @param[out] adjacencies node indices extracted from line
*/
static std::vector<vid_t> VARIABLE_IS_NOT_USED parseLine(std::string line);
static std::vector<vid_t> VARIABLE_IS_NOT_USED parseLine(std::string line) {
std::stringstream stream(line);
std::string token;
char delim = ' ';
std::vector<vid_t> adjacencies;
// split string and push adjacent nodes
while (std::getline(stream, token, delim)) {
if (token.size() != 0) {
vid_t v = atoi(token.c_str());
adjacencies.push_back(v);
}
}
return adjacencies;
}
/**
* Converts a graph from the METIS adjacency format.
* See http://people.sc.fsu.edu/~jburkardt/data/metis_graph/metis_graph.html for format documentation.
* NOTE: contributed by clstaudt
*/
template <typename EdgeDataType, typename FinalEdgeDataType>
void convert_metis(std::string inputPath, sharder<EdgeDataType, FinalEdgeDataType> &sharderobj) {
std::cout << "[INFO] reading METIS graph file" << std::endl;
std::ifstream graphFile(inputPath.c_str());
if (! graphFile.good()) {
logstream(LOG_FATAL) << "Could not load :" << inputPath << " error: " << strerror(errno) << std::endl;
}
std::string line; // current line
// handle header line
int n = 0; // number of nodes
int m = 0; // number of edges
int weighted; // indicates weight scheme:
if (std::getline(graphFile, line)) {
while (line[0] == '%') { // skip comments
std::getline(graphFile, line);
}
std::vector<uint> tokens = parseLine(line);
n = tokens[0];
m = tokens[1];
if (tokens.size() == 2) {
weighted = 0;
} if (tokens.size() == 3) {
weighted = tokens[2];
if (weighted != 0) {
logstream(LOG_FATAL) << "node and edge weights currently not supported by parser" << std::endl;
}
}
} else {
logstream(LOG_FATAL) << "getting METIS file header failed" << std::endl;
}
logstream(LOG_INFO) << "reading graph with n=" << n << ", m=" << m << std::endl;
vid_t u = 0; // starting node index
// handle content lines
while (graphFile.good()) {
do {
std::getline(graphFile, line);
} while (line[0] == '%'); // skip comments
// parse adjacency line
std::vector<vid_t> adjacencies = parseLine(line);
for (std::vector<vid_t>::iterator it=adjacencies.begin(); it != adjacencies.end(); ++it) {
vid_t v = *it;
if (u <= v) { // add edge only once; self-loops are allowed
sharderobj.preprocessing_add_edge(u, v, EdgeDataType());
}
}
u++;
}
}
/**
* Converts a graph from cassovary's (Twitter) format. Edge values are not supported,
* and each edge gets the default value for the type. Self-edges are ignored.
*/
template <typename EdgeDataType, typename FinalEdgeDataType>
void convert_cassovary(std::string basefilename, sharder<EdgeDataType, FinalEdgeDataType> &sharderobj) {
std::vector<std::string> parts;
std::string dirname = get_dirname(basefilename);
std::string prefix = get_filename(basefilename);
std::cout << "dir=[" << dirname << "] prefix=[" << prefix << "]" << std::endl;
getdir(dirname, parts);
for(std::vector<std::string>::iterator it=parts.begin(); it != parts.end(); ++it) {
std::string inputfile = *it;
if (inputfile.find(prefix) == 0 && inputfile.find("tmp") == inputfile.npos) {
std::cout << "Going to process: " << inputfile << std::endl;
}
}
for(std::vector<std::string>::iterator it=parts.begin(); it != parts.end(); ++it) {
std::string inputfile = *it;
if (inputfile.find(prefix) == 0 && inputfile.find(".tmp") == inputfile.npos) {
inputfile = dirname + "/" + inputfile;
std::cout << "Process: " << inputfile << std::endl;
FILE * inf = fopen(inputfile.c_str(), "r");
if (inf == NULL) {
logstream(LOG_FATAL) << "Could not load :" << inputfile << " error: " << strerror(errno) << std::endl;
}
assert(inf != NULL);
logstream(LOG_INFO) << "Reading in cassovary format!" << std::endl;
int maxlen = 100000000;
char * s = (char*) malloc(maxlen);
size_t bytesread = 0;
char delims[] = " \t";
size_t linenum = 0;
size_t lastlog = 0;
while(fgets(s, maxlen, inf) != NULL) {
linenum++;
if (bytesread - lastlog >= 500000000) {
logstream(LOG_DEBUG) << "Read " << linenum << " lines, " << bytesread / 1024 / 1024. << " MB" << std::endl;
lastlog = bytesread;
}
FIXLINE(s);
bytesread += strlen(s);
if (s[0] == '#') continue; // Comment
if (s[0] == '%') continue; // Comment
char * t = strtok(s, delims);
vid_t from = atoi(t);
t = strtok(NULL,delims);
if (t != NULL) {
vid_t num = atoi(t);
// Read next line
linenum += num + 1;
for(vid_t i=0; i < num; i++) {
s = fgets(s, maxlen, inf);
FIXLINE(s);
vid_t to = atoi(s);
if (from != to) {
sharderobj.preprocessing_add_edge(from, to, EdgeDataType());
}
}
}
}
free(s);
fclose(inf);
}
}
}
/**
* Converts a set of files in the binedgelist format (binary edge list)
*/
template <typename EdgeDataType, typename FinalEdgeDataType>
void convert_binedgelist(std::string basefilename, sharder<EdgeDataType, FinalEdgeDataType> &sharderobj) {
std::vector<std::string> parts;
std::string dirname = get_dirname(basefilename);
std::string prefix = get_filename(basefilename);
std::cout << "dir=[" << dirname << "] prefix=[" << prefix << "]" << std::endl;
getdir(dirname, parts);
for(std::vector<std::string>::iterator it=parts.begin(); it != parts.end(); ++it) {
std::string inputfile = *it;
if (inputfile.find(prefix) == 0 && inputfile.find("tmp") == inputfile.npos) {
std::cout << "Going to process: " << inputfile << std::endl;
}
}
for(std::vector<std::string>::iterator it=parts.begin(); it != parts.end(); ++it) {
std::string inputfile = *it;
if (inputfile.find(prefix) == 0 && inputfile.find(".tmp") == inputfile.npos) {
inputfile = dirname + "/" + inputfile;
std::cout << "Process: " << inputfile << std::endl;
FILE * inf = fopen(inputfile.c_str(), "r");
while(!feof(inf)) {
vid_t from;
vid_t to;
size_t res1 = fread(&from, sizeof(vid_t), 1, inf);
size_t res2 = fread(&to, sizeof(vid_t), 1, inf);
assert(res1 > 0 && res2 > 0);
if (from != to) {
sharderobj.preprocessing_add_edge(from, to, EdgeDataType());
}
}
fclose(inf);
}
}
}
// TODO: remove code duplication.
template <typename EdgeDataType, typename FinalEdgeDataType>
void convert_binedgelistval(std::string basefilename, sharder<EdgeDataType, FinalEdgeDataType> &sharderobj) {
std::vector<std::string> parts;
std::string dirname = get_dirname(basefilename);
std::string prefix = get_filename(basefilename);
std::cout << "dir=[" << dirname << "] prefix=[" << prefix << "]" << std::endl;
getdir(dirname, parts);
for(std::vector<std::string>::iterator it=parts.begin(); it != parts.end(); ++it) {
std::string inputfile = *it;
if (inputfile.find(prefix) == 0 && inputfile.find("tmp") == inputfile.npos) {
std::cout << "Going to process: " << inputfile << std::endl;
}
}
for(std::vector<std::string>::iterator it=parts.begin(); it != parts.end(); ++it) {
std::string inputfile = *it;
if (inputfile.find(prefix) == 0 && inputfile.find(".tmp") == inputfile.npos) {
inputfile = dirname + "/" + inputfile;
std::cout << "Process: " << inputfile << std::endl;
FILE * inf = fopen(inputfile.c_str(), "r");
while(!feof(inf)) {
vid_t from;
vid_t to;
EdgeDataType edgeval;
size_t res1 = fread(&from, sizeof(vid_t), 1, inf);
size_t res2 = fread(&to, sizeof(vid_t), 1, inf);
size_t res3 = fread(&edgeval, sizeof(EdgeDataType), 1, inf);
assert(res1 > 0 && res2 > 0 && res3 > 0);
if (from != to) {
sharderobj.preprocessing_add_edge(from, to, edgeval);
}
}
fclose(inf);
}
}
}
/**
* Converts a graph input to shards. Preprocessing has several steps,
* see sharder.hpp for more information.
*/
template <typename EdgeDataType, typename FinalEdgeDataType>
int convert(std::string basefilename, std::string nshards_string) {
sharder<EdgeDataType, FinalEdgeDataType> sharderobj(basefilename);
std::string file_type_str = get_option_string_interactive("filetype", "edgelist, adjlist, binedgelist, metis");
if (file_type_str != "adjlist" && file_type_str != "edgelist" && file_type_str != "binedgelist" &&
file_type_str != "multivalueedgelist" && file_type_str != "metis") {
logstream(LOG_ERROR) << "You need to specify filetype: 'edgelist', 'adjlist', 'binedgelist', or 'metis'." << std::endl;
assert(false);
}
/* Start preprocessing */
sharderobj.start_preprocessing();
if (file_type_str == "adjlist") {
convert_adjlist<EdgeDataType, FinalEdgeDataType>(basefilename, sharderobj);
} else if (file_type_str == "edgelist") {
convert_edgelist<EdgeDataType, FinalEdgeDataType>(basefilename, sharderobj);
#ifdef DYNAMICEDATA
} else if (file_type_str == "multivalueedgelist" ) {
convert_edgelist<EdgeDataType, FinalEdgeDataType>(basefilename, sharderobj, true);
#endif
} else if (file_type_str == "binedgelist") {
convert_binedgelistval<EdgeDataType, FinalEdgeDataType>(basefilename, sharderobj);
} else if (file_type_str == "metis") {
convert_metis<EdgeDataType, FinalEdgeDataType>(basefilename, sharderobj);
} else {
assert(false);
}
/* Finish preprocessing */
sharderobj.end_preprocessing();
vid_t max_vertex_id = get_option_int("maxvertex", 0);
if (max_vertex_id > 0) {
sharderobj.set_max_vertex_id(max_vertex_id);
}
int nshards = sharderobj.execute_sharding(nshards_string);
logstream(LOG_INFO) << "Successfully finished sharding for " << basefilename << std::endl;
logstream(LOG_INFO) << "Created " << nshards << " shards." << std::endl;
return nshards;
}
/**
* Converts a graph input to shards with no edge values. Preprocessing has several steps,
* see sharder.hpp for more information.
*/
static int VARIABLE_IS_NOT_USED convert_none(std::string basefilename, std::string nshards_string);
static int VARIABLE_IS_NOT_USED convert_none(std::string basefilename, std::string nshards_string) {
sharder<dummy> sharderobj(basefilename);
sharderobj.set_no_edgevalues();
std::string file_type_str = get_option_string_interactive("filetype", "edgelist, adjlist, cassovary, binedgelist");
if (file_type_str != "adjlist" && file_type_str != "edgelist" && file_type_str != "cassovary" && file_type_str != "binedgelist" && file_type_str != "metis") {
logstream(LOG_ERROR) << "You need to specify filetype: 'edgelist' or 'adjlist'." << std::endl;
assert(false);
}
/* Start preprocessing */
sharderobj.start_preprocessing();
if (file_type_str == "adjlist") {
convert_adjlist<dummy>(basefilename, sharderobj);
} else if (file_type_str == "edgelist") {
convert_edgelist<dummy>(basefilename, sharderobj);
} else if (file_type_str == "cassovary") {
convert_cassovary<dummy>(basefilename, sharderobj);
} else if (file_type_str == "binedgelist") {
convert_binedgelist<dummy>(basefilename, sharderobj);
} else if (file_type_str == "metis") {
convert_metis<dummy>(basefilename, sharderobj);
}
/* Finish preprocessing */
sharderobj.end_preprocessing();
if (get_option_int("skipsharding", 0) == 1) {
std::cout << "Skip sharding..." << std::endl;
exit(0);
}
vid_t max_vertex_id = get_option_int("maxvertex", 0);
if (max_vertex_id > 0) {
sharderobj.set_max_vertex_id(max_vertex_id);
}
int nshards = sharderobj.execute_sharding(nshards_string);
logstream(LOG_INFO) << "Successfully finished sharding for " << basefilename << std::endl;
logstream(LOG_INFO) << "Created " << nshards << " shards." << std::endl;
return nshards;
}
template <typename EdgeDataType>
int convert_if_notexists_novalues(std::string basefilename, std::string nshards_string, bool &didexist) {
int nshards;
/* Check if input file is already sharded */
if ((nshards = find_shards<EdgeDataType>(basefilename, nshards_string))) {
logstream(LOG_INFO) << "Found preprocessed files for " << basefilename << ", num shards=" << nshards << std::endl;
didexist = true;
if (check_origfile_modification_earlier<EdgeDataType>(basefilename, nshards)) {
return nshards;
}
}
didexist = false;
logstream(LOG_INFO) << "Did not find preprocessed shards for " << basefilename << std::endl;
logstream(LOG_INFO) << "(Edge-value size: " << sizeof(EdgeDataType) << ")" << std::endl;
logstream(LOG_INFO) << "Will try create them now..." << std::endl;
nshards = convert<dummyC<EdgeDataType>, EdgeDataType>(basefilename, nshards_string);
return nshards;
}
template <typename EdgeDataType>
int convert_if_notexists(std::string basefilename, std::string nshards_string, bool &didexist) {
int nshards;
/* Check if input file is already sharded */
if ((nshards = find_shards<EdgeDataType>(basefilename, nshards_string))) {
logstream(LOG_INFO) << "Found preprocessed files for " << basefilename << ", num shards=" << nshards << std::endl;
didexist = true;
if (check_origfile_modification_earlier<EdgeDataType>(basefilename, nshards)) {
return nshards;
}
}
didexist = false;
logstream(LOG_INFO) << "Did not find preprocessed shards for " << basefilename << std::endl;
logstream(LOG_INFO) << "(Edge-value size: " << sizeof(EdgeDataType) << ")" << std::endl;
logstream(LOG_INFO) << "Will try create them now..." << std::endl;
nshards = convert<EdgeDataType, EdgeDataType>(basefilename, nshards_string);
return nshards;
}
// First type is for the input phase, second is what is needed in computation
template <typename EdgeDataType, typename FinalEdgeType>
int convert_if_notexists(std::string basefilename, std::string nshards_string, bool &didexist) {
int nshards;
/* Check if input file is already sharded */
if ((nshards = find_shards<FinalEdgeType>(basefilename, nshards_string))) {
logstream(LOG_INFO) << "Found preprocessed files for " << basefilename << ", num shards=" << nshards << std::endl;
didexist = true;
if (check_origfile_modification_earlier<FinalEdgeType>(basefilename, nshards)) {
return nshards;
}
}
didexist = false;
logstream(LOG_INFO) << "Did not find preprocessed shards for " << basefilename << std::endl;
logstream(LOG_INFO) << "(Edge-value size: " << sizeof(FinalEdgeType) << ")" << std::endl;
logstream(LOG_INFO) << "Will try create them now..." << std::endl;
nshards = convert<EdgeDataType, FinalEdgeType>(basefilename, nshards_string);
return nshards;
}
template <typename EdgeDataType, typename FinalEdgeType>
int convert_if_notexists(std::string basefilename, std::string nshards_string) {
bool b;
return convert_if_notexists<EdgeDataType, FinalEdgeType>(basefilename, nshards_string, b);
}
template <typename EdgeDataType>
int convert_if_notexists(std::string basefilename, std::string nshards_string) {
bool b;
return convert_if_notexists<EdgeDataType, EdgeDataType>(basefilename, nshards_string, b);
}
template <typename EdgeDataType>
int convert_if_notexists_novalues(std::string basefilename, std::string nshards_string) {
bool b;
return convert_if_notexists_novalues<EdgeDataType>(basefilename, nshards_string, b);
}
} // end namespace
#endif
You can’t perform that action at this time.