public void GetGraphCliques(Graph g, List <List <int> > cliques)
{
int[,] graphData = (int[, ])g.GraphData.Clone();
Graph gCp = new Graph(g.GraphData);
List <int> clique;
int sizeToDelete = 0;
List <int> vertices = new List <int>();
while (gCp.AnyEdgesLeft())
{
mgAlg = new ModularGraphMaxCliqueAlgorithm();
mgAlg.MaxCliquePolynomial(gCp, true);
clique = new List <int>();
// issue when we dissolve the graph
if (mgAlg._maxCP.Count == 0)
{
break;
}
for (int i = 0; i < mgAlg._maxCP.Count; i++)
{
clique.Add(mgAlg._maxCP[i]);
vertices.Add(mgAlg._maxCP[i]);
}
sizeToDelete += clique.Count;
cliques.Add(clique);
for (int i = 0; i < mgAlg._maxCP.Count; i++)
{
for (int j = 0; j < g.GraphData.GetLength(0); j++)
{
graphData[mgAlg._maxCP[i], j] = 0;
}
}
for (int i = 0; i < g.GraphData.GetLength(0); i++)
{
for (int j = 0; j < mgAlg._maxCP.Count; j++)
{
graphData[i, mgAlg._maxCP[j]] = 0;
}
}
gCp = new Graph((int[, ])graphData.Clone());
gCp.Size -= sizeToDelete;
}
vertices.Sort((a, b) => a.CompareTo(b));
// for single vertices
if (vertices.Count != g.GraphData.GetLength(0))
{
for (int i = 0; i < g.GraphData.GetLength(0); i++)
{
if (!vertices.Contains(i))
{
cliques.Add(new List <int> {
i
});
}
}
}
}
