blob: 7fe80c323f68a9bcc37a71158b7ae6a5fe6310ab (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
{ 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;
buildInputs = [
autoreconfHook
];
meta = with stdenv.lib; {
homepage = "https://users.aalto.fi/~pat/cliquer.html";
downloadPage = src.meta.homepage; # autocliquer
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.
'';
license = licenses.gpl2Plus;
maintainers = teams.sage.members;
platforms = platforms.unix;
};
}
|
