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

Nėra oficialių „openSUSE Leap 16.0“ paketų

Platinamieji paketai

openSUSE Tumbleweed

openSUSE Leap 16.0

openSUSE Leap 15.6

SLFO 1.2

openSUSE Backports for SLE 15 SP7

openSUSE Backports for SLE 15 SP4

Nepalaikomos platinamųjų paketų versijos

Šie platinamieji paketai nėra oficialiai palaikomi. Už šių paketų naudojimą atsakomybę turėtumėte prisiimti patys.