Include MaximumClique heuristic (for now)

Author: simonlindholm

content/graph/MaximalCliques.h

@@ -5,13 +5,15 @@
  * Source: https://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm
  * Description: Runs a callback for all maximal cliques in a graph (given as a
  * symmetric bitset matrix; self-edges not allowed). Callback is given a bitset
- * representing the maximal clique. Possible optimization: on the top-most
- * recursion level, ignore 'cands', and go through nodes in order of increasing
- * degree, where degrees go down as nodes are removed.
+ * representing the maximal clique.
  * Time: O(3^{n/3}), much faster for sparse graphs
  * Status: fuzz-tested
  */
 #pragma once
+/// Possible optimization: on the top-most
+/// recursion level, ignore 'cands', and go through nodes in order of increasing
+/// degree, where degrees go down as nodes are removed.
+/// (mostly irrelevant given MaximumClique)
 
 typedef bitset<128> B;
 template<class F>

content/graph/MaximumClique.h

@@ -3,7 +3,7 @@
  * Date: 2019-05-10
  * License: GPL3+
  * Source: https://en.wikipedia.org/wiki/MaxCliqueDyn_maximum_clique_algorithm, https://gitlab.com/janezkonc/mcqd/blob/master/mcqd.h
- * Description: Finds a maximum clique of a graph (given as symmetric bitset
+ * Description: Quickly finds a maximum clique of a graph (given as symmetric bitset
  * matrix; self-edges not allowed). Can be used to find a maximum independent
  * set by finding a clique of the complement graph.
  * Time: Runs in about 1s for n=155 and worst case random graphs (p=.90). Runs

content/graph/chapter.tex

@@ -30,7 +30,7 @@ \section{DFS algorithms}
 
 \section{Heuristics}
 	\kactlimport{MaximalCliques.h}
-	% \kactlimport{MaximumClique.h}
+	\kactlimport{MaximumClique.h}
 	\kactlimport{MaximumIndependentSet.h}
 
 \section{Trees}
@@ -41,4 +41,4 @@ \section{Trees}
 	\kactlimport{LinkCutTree.h}
 	\kactlimport{DirectedMST.h}
 	\kactlimport{MatrixTree.h}
-	\hardcolumnbreak
+	\columnbreak