This option finds the maximal cliques in a graph. A clique is subgraph where all the vertices are adjacent to each other.
The first line specifies the calculation required. It must contain
format cliques
format cliques l 1 5 l 1 3 l 1 7 l 2 8 l 2 6 l 3 1 l 3 7 l 3 5 l 4 8 l 4 6 l 5 1 l 5 7 l 6 4 l 6 2 l 7 3 l 7 5 l 8 2 l 8 2 1 5 3 7 2 8 6 4
There was an error while loading. Please reload this page.