%FILENAME%
haskell-graphscc-1.0.4-24.0-pentium4.pkg.tar.zst

%NAME%
haskell-graphscc

%BASE%
haskell-graphscc

%VERSION%
1.0.4-24.0

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

%CSIZE%
21896

%ISIZE%
57186

%MD5SUM%
4c027d9245ed1cfddd6d680a2f1d12d1

%SHA256SUM%
5fe5589cdbea6d21ddd1a243d6c61962b44a9a38b20a6da7dc553dd33c191e75

%PGPSIG%
iQIzBAABCAAdFiEEQVthRbOJyKdMn8SyLBRsAalSrA8FAmFjlsYACgkQLBRsAalSrA+koxAAsdS3Xctm9LnPt/p9Nwq23zvdMddf98YlXk4TSyDebEIdDfNLsFPezKLoT6ho4cgJCLIUT5F9B2TRD8AFOvkM+Q+MwtBHurbYgS+sn0VShR5PC6f0uAla65YA4DeU/MZhsLqp1tI4WyyeATSY2RLtaHvzyWYX4Yx68uH6DEOBn/ag4FdPDvktA0FJ1ynfWCUQZc5kk/5J3bS4rAb6/ctrBf/NzWRdSQsSaglryNRa5arEaZz8LfjGUTJ2bIcF0ZMo94Cg4iP2DPfKqxsDSzbGZG+X7pyB2TXKf+vwUOnvYFRjIXmVIq1pOfho3MVn8F2gYpW0T4YvAkrbnrzcC3a2lX4XQUMQWYK8tpjiThPdBMcnii3jLRw8Cc8I/umz7cK86M4BN4s8Ub1mABhwQeLrRwq+MDmCMy8/QzKmqYU9gDp55u/CSHip1zou/O/lvxc86ZhYfs3DXXD7BEQdkKPTjVqvlri8eudIdprb+HiOi7jXuduDuHXtjgSLaLGN9sbhO7foO1pPBwrezyHVPegLj1FV3Q5hgJbVVUXOXHISoGErvR4us9I8rutqxofaJutwD3mc30Yp6iv53g6Yo1dlOHhs0g4TCbD3TEnAW1cPaQSF1Vhg0yzslX1wpIBvAawCDvWJM7AgzryLQkZwGObYulihnc+J3nU0ZAadmhlYoc0=

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

%LICENSE%
BSD

%ARCH%
pentium4

%BUILDDATE%
1633916573

%PACKAGER%
Erich Eckner <arch32 at eckner dot net>

%DEPENDS%
ghc-libs

%MAKEDEPENDS%
ghc

