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
Paths come from the repository package-file index for the observed builds. They describe archive/package associations, not every file that will exist on a running system after maintainer scripts, alternatives, generated state, diversions, or installation choices.
Each row is recorded package-index metadata for one version, architecture, suite, and repository. Names, URLs, and sizes are source-reported; a link is a potentially mutable retrieval location, not an OpenFactory redistribution claim or proof that OpenFactory retained the artifact bytes.