-
Notifications
You must be signed in to change notification settings - Fork 1
/
MFSGenerator.cc
54 lines (42 loc) · 1.14 KB
/
MFSGenerator.cc
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
#include "MFSGenerator.hpp"
#include "quick-cliques/src/TomitaAlgorithm.h"
using std::function;
using std::list;
MFSGenerator::MFSGenerator(const Graph<size_t>& graph,
function<bool(const list<int>&)> callback)
{
/* Construct adjacency matrix of the graph */
Vector<Vector<size_t>> vAdjacencyMatrix = graph.adjacencyMatrix();
n = graph.size();
adjacencyMatrix = (char**)calloc(n, sizeof(char*));
for (int i = 0; i < n; i++)
{
adjacencyMatrix[i] = (char*)calloc(n, sizeof(char));
for (int j = 0; j < n; j++)
adjacencyMatrix[i][j] = vAdjacencyMatrix[i][j];
}
/* Initialize algorithm */
pAlgorithm = new TomitaAlgorithm(adjacencyMatrix, n);
pAlgorithm->AddCallBack(callback); //DF: this callback will be invoked once the MFS is generated by pAlgorithm
}
long MFSGenerator::run()
{
list<list<int>> cliques;
return pAlgorithm->Run(cliques);
}
MFSGenerator::~MFSGenerator()
{
/* Free adjacency matrix */
if (adjacencyMatrix != nullptr)
{
int i = 0;
while (i < n)
{
free(adjacencyMatrix[i]);
i++;
}
free(adjacencyMatrix);
}
/* Delete algorithm object */
delete pAlgorithm;
}