An fork of the annas graph library built by Sam Wilson (https://bitbucket.org/sam_wilson/annas). This library was modified to provide an implementation of Tarjan's decomposition algorithm[1] and recognition, optimal colouring and maximum weight clique algorithms from [2].
[1] - R.R.Tarjan. Decomposition by clique separators. ScienceDirect. Discrete Mathematics, 55(2), 1985
[2] - I.Penev, V.Boncompagni, K.Vuskovic, Clique-cutsets beyond chordal graphs. arXiv:1707.03252, 2017