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
|
/*
Projet d'algorithmique et programmation 2013-2014
(cours de C.Matthieu et J.Stern)
Alex AUVOLAT, Mendes OULAMARA
Sujet : Algorithme de Bron-Kerbosch pour Maximum-Clique
(cf maxclique.pdf)
*/
#include "sets.h"
#include "graph.h"
void max_clique_a(const graph g, set k, set c, set *mc) {
if (is_set_empty(c)) {
if (set_size(k) > set_size(*mc)) {
delete_set(*mc);
*mc = copy_set(k);
printf("Found new max clique: "); dump_set(*mc);
}
} else {
set cc = copy_set(c);
while (!(is_set_empty(cc))) {
int x = elt_of_set(cc);
set_remove_ip(x, cc);
set k2 = set_add(x, k);
set c2 = set_inter(c, graph_neighbours(g, x));
max_clique_a(g,k2, c2, mc);
delete_set(k2);
delete_set(c2);
}
delete_set(cc);
}
}
// Driver
void usage(char *pname) {
printf("\nUsage:\n\t%s [options] [<graph file>]\n\n", pname);
printf("Available options:\n");
printf("\n -d\n\tRead input in DIMACS format\n");
printf("\n -h, --help\n\tShow this help page\n");
}
int main(int argc, char **argv) {
int i;
int dimacs = 0;
char *filename = "-";
for (i = 1; i < argc; i++) {
if (!strcmp(argv[i], "-d")) {
dimacs = 1;
} else if (argv[i][0] == '-') {
usage(argv[0]);
return 0;
} else {
filename = argv[i];
}
}
FILE *f = stdin;
if (strcmp(filename, "-")) {
f = fopen(filename, "r");
if (f == NULL) {
fprintf(stderr, "Error: could not open file %s\n", filename);
return 1;
}
}
graph g = (dimacs ? load_graph_dimacs(f) : load_graph(f));
if (g == NULL) {
fprintf(stderr, "Error loading file %s\n", filename);
return 1;
}
dump_graphviz(g, stdout);
// do stuff with graph
set max_clique = empty_set(g->N);
set init_s = full_set(g->N);
set init_k = empty_set(g->N);
max_clique_a(g, init_k, init_s, &max_clique);
printf("Max clique: "); dump_set(max_clique);
delete_graph(g);
return 0;
}
|
