{"library":"passagemath-mcqd","title":"passagemath-mcqd","description":"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.","language":"python","status":"active","last_verified":"Fri May 01","install":{"commands":["pip install passagemath-mcqd"],"cli":null},"imports":["from sage.graphs.cliquer import mcqd"],"auth":{"required":false,"env_vars":[]},"quickstart":{"code":"import os\nfrom sage.graphs.cliquer import mcqd\nimport sage.graphs.graph as graph\n\nG = graph.Graph([(0,1),(1,2),(2,0),(0,3)])\nclique = mcqd(G)\nprint('Maximum clique:', clique)","lang":"python","description":"Find a maximum clique in a small graph.","tag":null,"tag_description":null,"last_tested":null,"results":[]},"compatibility":null}