The passagemath-mcqd library provides a Python interface to the MCQD algorithm for finding maximum cliques in undirected graphs. It is part of the passagemath ecosystem and currently at version 10.8.4, supporting Python 3.11 through 3.14. Release cadence is tied to the parent passagemath project.
pip install passagemath-mcqdVerified import paths — ran on the pinned version, not inferred.
Find a maximum clique in a small graph.
Convert your graph using Graph(nx_graph) from sage.graphs.graph.
Use G.vertices() to map indices back to labels: [G.vertices()[i] for i in mcqd(G)].
Use 'from sage.graphs.cliquer import mcqd'.