646b892680
Some checks failed
Periodic Merges (6h) / master → staging-nixos (push) Failing after 12m50s
Periodic Merges (6h) / master → staging-next (push) Failing after 12m54s
Periodic Merges (24h) / merge-base(master,staging) → haskell-updates (push) Failing after 11m54s
Periodic Merges (6h) / staging-next → staging (push) Failing after 12m13s
Periodic Merges (24h) / staging-next-25.05 → staging-25.05 (push) Failing after 13m24s
Periodic Merges (24h) / release-25.05 → staging-next-25.05 (push) Failing after 14m28s
42 lines
1.0 KiB
Nix
42 lines
1.0 KiB
Nix
{
|
|
lib,
|
|
stdenv,
|
|
fetchFromGitHub,
|
|
autoreconfHook,
|
|
}:
|
|
|
|
stdenv.mkDerivation rec {
|
|
version = "1.22";
|
|
pname = "cliquer";
|
|
|
|
# autotoolized version of the original cliquer
|
|
src = fetchFromGitHub {
|
|
owner = "dimpase";
|
|
repo = "autocliquer";
|
|
rev = "v${version}";
|
|
sha256 = "00gcmrhi2fjn8b246w5a3b0pl7p6haxy5wjvd9kcqib1xanz59z4";
|
|
};
|
|
|
|
doCheck = true;
|
|
|
|
nativeBuildInputs = [
|
|
autoreconfHook
|
|
];
|
|
|
|
meta = with lib; {
|
|
description = "Routines for clique searching";
|
|
longDescription = ''
|
|
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 Östergård.
|
|
It is designed with the aim of being efficient while still being flexible and
|
|
easy to use.
|
|
'';
|
|
homepage = "https://users.aalto.fi/~pat/cliquer.html";
|
|
downloadPage = src.meta.homepage; # autocliquer
|
|
license = licenses.gpl2Plus;
|
|
teams = [ teams.sage ];
|
|
mainProgram = "cl";
|
|
platforms = platforms.unix;
|
|
};
|
|
}
|