Routines for clique searching
Cliquer is a set of C routines for finding cliques in an arbitrary weighted graph. It uses an exact branch-and-bound algorithm developed by Patric Ostergard. It is designed with the aim of being efficient while still being flexible and easy to use. Note: this port do not use the upstream version, but the version autotoolized by Dima Pasechnik. See also: https://github.com/dimpase/autocliquer
$
pkg install cliquerOrigin
math/cliquer
Size
224KiB
License
GPLv2
Maintainer
ports@FreeBSD.org
Dependencies
0 packages
Required by
2 packages