cliquer 1.21 C routines for finding cliques in weighted graphs

Cliquer is a set of reentrant C routines for finding cliques in a weighted or unweighted graph. It uses an exact branch-and-bound algorithm. It can search for maximum or maximum-weight cliques or cliques with size or weight within a given range, restrict the search to maximal cliques, store cliques in memory and call a user-defined function for every found clique.