Home
Reading
Searching
Subscribe
Sponsors
Statistics
Posting
Contact
Spam
Lists
Links
About
Hosting
Filtering
Features Download
Marketing
Archives
FAQ
Blog
 
Gmane
From: Iavor Diatchki <iavor.diatchki <at> gmail.com>
Subject: Faster graph SCCs
Newsgroups: gmane.comp.lang.haskell.libraries
Date: Wednesday 2nd July 2008 21:19:20 UTC (over 9 years ago)
Hi,
I have implemented Tarjan's algorithm for computing the strongly
connected components of a graph.  It is considerably faster then
what's available in the "containers" package for larger graphs (see
the attached picture). It would be nice to replace the existing
implementation in the containers package, but I though that I'd check
with the mailing list before I do this.  If you want to try it out, I
have put the code on hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/GraphSCC

-Iavor
 
CD: 2ms