2014-07-14 13:21:41 +02:00
|
|
|
# This file was auto-generated by cabal2nix. Please do NOT edit manually!
|
|
|
|
|
2014-04-25 06:15:50 +02:00
|
|
|
{ cabal }:
|
|
|
|
|
|
|
|
cabal.mkDerivation (self: {
|
|
|
|
pname = "GraphSCC";
|
|
|
|
version = "1.0.4";
|
|
|
|
sha256 = "1wbcx3wb02adb7l4nchxla3laliz0h5q074vfw4z0ic833k977bq";
|
|
|
|
meta = {
|
|
|
|
description = "Tarjan's algorithm for computing the strongly connected components of a graph";
|
|
|
|
license = self.stdenv.lib.licenses.bsd3;
|
|
|
|
platforms = self.ghc.meta.platforms;
|
2014-08-09 13:48:22 +02:00
|
|
|
maintainers = with self.stdenv.lib.maintainers; [ thoughtpolice ];
|
2014-04-25 06:15:50 +02:00
|
|
|
};
|
|
|
|
})
|