cliquer

C routines for finding cliques in graphs

Cliquer is a set of C routines for finding cliques in an arbitrary weighted graph. It uses an exact branch-and-bound algorithm. Features: * support for both weighted and unweighted graphs (faster routines for unweighted graphs) * search for maximum clique / maximum-weight clique * search for clique with size / weight within a given range * restrict search to maximal cliques * store found cliques in memory * call a user-defined function for every clique found * Cliquer is re-entrant, so you can use the clique-searching functions from within the callback function