%FILENAME%
haskell-graphscc-1.0.4-25-x86_64.pkg.tar.zst

%NAME%
haskell-graphscc

%BASE%
haskell-graphscc

%VERSION%
1.0.4-25

%DESC%
Tarjan's algorithm for computing the strongly connected components of a graph

%CSIZE%
21478

%ISIZE%
64305

%MD5SUM%
96b1dac880893d44b49f82748e8a110a

%SHA256SUM%
196445243c674b615644bfdc84a84400c034fa88b28985e3bab7d0c7ef3dbe26

%PGPSIG%
iQJIBAABCAAyFiEE6HyevZCe8oInuRJWULwdtYO3lwYFAmNhM9kUHGFzbWVyb25AdWJsaW51eC5jb20ACgkQULwdtYO3lwYBMw/+Kdf947RxYUw70eOErWeWSkRqAv/NplrGpyxHWOcbX+7MTQgVFb0MwMEs8DBsQMlJpZXTuw820G7O7QLg3k8UYzSugz0YByQTR0JqMgGAolrPHub6IMJm/K5ngc2LU8LJqAJMjr54Fu7M9k7T0mbIQx/QL10rChl88Uaxrf6twqUoAv82Uec+910UeGyqY1zclPkdGEUWfYvOj+e8ttDiw7TBmi7EwY48by8aZZBxwqOSo/GfmmqXqBPwN/qla3QFavG8r4FNsPVXMYUHNtPQF3e83WL2q+/mW4mmklWhOO3ijbqOT4PcXJss3zfnWMHz7yA5ZJmStWUrWGPXIMT6DAA5HSMyh3Ql2g7AV3CiSM+XC98LaViSqpty29Oaeq6Yk9KlO95NlXzHshjtT1rHexxn2myWA0dKnm78xfpmnSR+fd4CSpZOKCpFxOyHG07fTva2DVkpoLxjJ7jLlPWxO01KB7vTl839YptewQI6iuvVc54enLNymL1nP0i4uIKN/Dn1psPoWWLiLCIC3J8ENUDkgpl0ZzWgHkzQisrQL5LCzs7nwVaEt477c2GJRQusFDAWzEqIsfuHZtXsV9cNnB912kpdtyoZDoeUJHU8Z+fqbuW324r4Gb7K02Sre3gXB/l5M995dV+lJcF6tNBxVrUt8zIeOf8rcFGkJtThvx4=

%URL%
https://hackage.haskell.org/package/GraphSCC

%LICENSE%
BSD

%ARCH%
x86_64

%BUILDDATE%
1641837059

%PACKAGER%
Felix Yan <felixonmars@archlinux.org>

%DEPENDS%
ghc-libs

%MAKEDEPENDS%
ghc

