Date: Tuesday, January 15, 2019 @ 18:11:11 Author: arojas Revision: 423356
Rename bliss-graphs Added: bliss/ bliss/trunk/ bliss/trunk/PKGBUILD bliss/trunk/digraph_heuristic.patch -------------------------+ PKGBUILD | 38 ++++++++++++++++++++++++++++++++++++++ digraph_heuristic.patch | 12 ++++++++++++ 2 files changed, 50 insertions(+) Added: bliss/trunk/PKGBUILD =================================================================== --- bliss/trunk/PKGBUILD (rev 0) +++ bliss/trunk/PKGBUILD 2019-01-15 18:11:11 UTC (rev 423356) @@ -0,0 +1,38 @@ +# Maintainer: Antonio Rojas <aro...@archlinux.org> + +pkgname=bliss +pkgver=0.73 +pkgrel=1 +pkgdesc="A library for computing automorphism groups and canonical forms of graphs" +arch=(x86_64) +url="http://www.tcs.tkk.fi/Software/bliss/index.html" +license=(GPL3) +depends=(gcc-libs) +conflicts=(bliss-graphs) +provides=(bliss-graphs) +replaces=(bliss-graphs) +source=("http://www.tcs.hut.fi/Software/bliss/bliss-$pkgver.zip" 'digraph_heuristic.patch') +sha256sums=('f57bf32804140cad58b1240b804e0dbd68f7e6bf67eba8e0c0fa3a62fd7f0f84' + '2f7a238347aa977b1ce1c0e9e1e955b8c213cc3a89522b586a1b8c596c88c7a5') + +prepare() { + cd bliss-$pkgver +# Fix splitting heuristics for digraphs + patch -p1 -i ../digraph_heuristic.patch +} + +build() { + cd bliss-$pkgver + + make +} + +package() { + cd bliss-$pkgver + + mkdir -p "$pkgdir"/usr/{include/bliss,lib,bin} + cp *.hh "$pkgdir"/usr/include/bliss/ + cp libbliss.a "$pkgdir"/usr/lib/ + cp bliss "$pkgdir"/usr/bin/ +} + Added: bliss/trunk/digraph_heuristic.patch =================================================================== --- bliss/trunk/digraph_heuristic.patch (rev 0) +++ bliss/trunk/digraph_heuristic.patch 2019-01-15 18:11:11 UTC (rev 423356) @@ -0,0 +1,12 @@ +--- bliss-0.72/graph.hh 2011-05-12 15:29:46.000000000 +0200 ++++ /home/azi/bliss-0.72/graph.hh 2014-12-30 11:14:20.917059666 +0100 +@@ -843,7 +843,7 @@ + bool is_equitable() const; + + /* Splitting heuristics, documented in more detail in the cc-file. */ +- SplittingHeuristic sh; ++ SplittingHeuristic sh = shs_f; + Partition::Cell* find_next_cell_to_be_splitted(Partition::Cell *cell); + Partition::Cell* sh_first(); + Partition::Cell* sh_first_smallest(); +