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
|
#include "ColPackHeaders.h"
#include <cstring>
#include <unordered_set>
using namespace ColPack;
void usage();
int main(int argc, char* argv[]) {
string fname;
string order("LARGEST_FIRST");
string methd("DISTANCE_ONE");
bool bVerbose(false);
unordered_set<string> ParaD1Color={"DISTANCE_ONE_OMP"};
unordered_set<string> BiColor={
"IMPLICIT_COVERING__STAR_BICOLORING",
"EXPLICIT_COVERING__STAR_BICOLORING",
"EXPLICIT_COVERING__MODIFIED_STAR_BICOLORING",
"IMPLICIT_COVERING__GREEDY_STAR_BICOLORING"
};
unordered_set<string> PartialColor={
"COLUMN_PARTIAL_DISTANCE_TWO",
"ROW_PARTIAL_DISTANCE_TWO"
};
for(int i=1; i<argc; i++){
if(argv[i][0]!='-') continue;
if( !strcmp(argv[i], "-f")) fname = argv[++i];
else if(!strcmp(argv[i], "-o")) order = argv[++i];
else if(!strcmp(argv[i], "-m")) methd = argv[++i];
else if(!strcmp(argv[i], "-v")) bVerbose = true;
else printf("Warning: unknown input argument\"%s\"",argv[i]);
}
if(fname.empty()) {usage(); exit(0); }
if(BiColor.count(methd)){
if(bVerbose) fprintf(stdout,"\ngraph: %s\norder: %s\nmethd: %s\nBiColoring\n",fname.c_str(), order.c_str(), methd.c_str());
BipartiteGraphBicoloringInterface *p = new BipartiteGraphBicoloringInterface(0, fname.c_str(), "AUTO_DETECTED");
p->Bicoloring(order.c_str(), methd.c_str());
if(bVerbose) fprintf(stdout, "number of colors: ");
fprintf(stdout,"%d", p->GetVertexColorCount());
delete p; p=nullptr;
}
else if(PartialColor.count(methd)){
if(bVerbose) fprintf(stdout,"\ngraph: %s\norder: %s\nmethd: %s\nPartial Distantce Two Coloring\n",fname.c_str(), order.c_str(), methd.c_str());
BipartiteGraphPartialColoringInterface *p = new BipartiteGraphPartialColoringInterface(0, fname.c_str(), "AUTO_DETECTED");
p->PartialDistanceTwoColoring(order.c_str(), methd.c_str());
if(bVerbose) fprintf(stdout, "number of colors: ");
fprintf(stdout,"%d", p->GetVertexColorCount());
delete p; p=nullptr;
}
else if(ParaD1Color.count(methd)){
if(bVerbose) fprintf(stdout,"\ngraph: %s\norder: %s\nmethd: %s\nShared Memory General Graph Coloring\n",fname.c_str(), order.c_str(), methd.c_str());
GraphColoringInterface *g = new GraphColoringInterface(SRC_FILE, fname.c_str(), "AUTO_DETECTED");
g->Coloring(order.c_str(), methd.c_str());
delete g; g=nullptr;
}
else{
if(bVerbose) fprintf(stdout,"\ngraph: %s\norder: %s\nmethd: %s\nGeneral Graph Coloring\n",fname.c_str(), order.c_str(), methd.c_str());
GraphColoringInterface *g = new GraphColoringInterface(SRC_FILE, fname.c_str(), "AUTO_DETECTED");
g->Coloring(order.c_str(), methd.c_str());
if(bVerbose) fprintf(stdout, "number of colors: ");
fprintf(stdout,"%d",g->GetVertexColorCount());
delete g; g=nullptr;
}
if(bVerbose)fprintf(stdout,"\n\n");
return 0;
}
void usage(){
fprintf(stderr, "\nusage: ./ColPack -f <gname> -o <ordering> -m <methods> [-v]\n"
"-f <gname> : Input file name\n"
"-o <order> : LARGEST_FIRST\n"
" SMALLEST_LAST,\n"
" DYNAMIC_LARGEST_FIRST,\n"
" INCIDENCE_DEGREE,\n"
" NATURAL,\n"
" RANDOM\n"
"-m <methods>: DISTANCE_ONE\n"
" ACYCLIC\n"
" ACYCLIC_FOR_INDIRECT_RECOVERY\n"
" STAR\n"
" RESTRICTED_STAR\n"
" DISTANCE_TWO\n"
" --------------------\n"
" DISTANCE_ONE_OMP (automatic display: nThreads,num_colors,timall,conflicts,loops)\n "
" --------------------\n"
" IMPLICIT_COVERING__STAR_BICOLORING\n"
" EXPLICIT_COVERING__STAR_BICOLORING\n"
" EXPLICIT_COVERING__MODIFIED_STAR_BICOLORING\n"
" IMPLICIT_COVERING__GREEDY_STAR_BICOLORING\n"
" --------------------\n"
" COLUMN_PARTIAL_DISTANCE_TWO\n"
" ROW_PARTIAL_DISTANCE_TWO\n"
"\n"
"-v : verbose for debug infomation\n"
"\n"
"\n"
"Examples:\n"
"./ColPack -f ../Graphs/bcsstk01.mtx -o LARGEST_FIRST -m DISTANCE_ONE -v\n"
"./ColPack -f ../Graphs/bcsstk01.mtx -o SMALLEST_LAST -m ACYCLIC -v\n"
"./ColPack -f ../Graphs/bcsstk01.mtx -o DYNAMIC_LARGEST_FIRST -m DISTANCE_ONE_OMP -v\n"
"\n"
);
}
|
