%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%
iQIzBAABCAAdFiEEtZcfLFwQqaCMYAMPeGxj8zDXy5IFAmHcchQACgkQeGxj8zDXy5JqmBAAlMvQ4M0qkoNxCuKtbpl8qBBknCk6K0oyD7WzY1ejnW0owLW9639oXNHqVWIlXHOJ3LrKG9pPc6nksnOVbEUuXUDS1qANm9bW5nS/luQYd9iYp2C/VBNNr3qBwKGZEz1IuMW31tJ7ZS5uA8a8XsKJVAeL0iR0yqZ1C/bHwvWODk5XIpnmhz0CWmq/tVvwWcr+fdPia7Mbh2UMoubggumzUQ9W9IWwiLnYhiuWGwi6xN3ELo80qHGmibVZ2G4Ow5rJgMaEwUdgHLhD3fGBZmxmBE1mWXEwzLZ7+z3J7cDCQZCGE1XR8tPASFZBz2KbFNIs+ARfoRxUwVQGIigRtmHe91jeISxkp5iWpVxAOSGLT1juiDziNSsTcgGTEGZc5ruW+XpPKr0kl2dZWsuEZzdhWabdn41z7XAtWxsACUBSOZZ0m/ki25XQkAxcAxDvgzH6faBChCLn6YNtMkJRMnXkaOqRjB/jM58nl/9+AWwstN3SIAA24GE1TWyoZx0+HN1kTX5E46S0uRFydMjQki9Q97mxNVJrqLlcWAE4yBq8nxk3mLZv4tJhPXOHMV2hS38Db5262r071lGuKYb/5h1XwfxCMiDW3zEv4UTuttS3hU6BcC41Ocs3NHVEUEiYefXMcsRZK8exPx4ZO57swXfymsySNaK31asC5AEc5b0keaQ=

%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

