Anyone out there know of an example of an implementation of Gabow's
SCC algorithm out there on the interwebs? (Note: I'm *not* looking for
Gabow's various graph matching algorithms).

The language doesn't matter

-Nat

"Nathaniel Calloway" <ntc6@cornell.edu> wrote in message
news:uod7gsbzv.fsf@cornell.edu...
I got 511 hits with this:
http://www.google.com/search?hl=en&q...+scc+algorithm

Have you already explored the net yourself?


** Posted from http://www.teranews.com **

"Dann Corbit" <dcorbit@connx.com> writes:

Yes.

Did you bother to click on anything in that search? Click on the
first 50 or so, and you'll get the idea why I asked here.

But that's beside the point. Even if my question was easily answered
by a google search, if you don't want to help, just delete.

-Nat

On May 8, 6:38*pm, Nathaniel Calloway <n...@cornell.edu> wrote:
Yes.

I found several.

Here is code in python. Have a nice day.
http://people.redhat.com/laroche/pyr...nload/pyrpm.py

user923005 <dcorbit@connx.com> writes:

Out of curiosity, I decided to see how far down that was on your
search. Wow, 87th! You really didn't have to go to that much work

Snarkiness aside, thanks.

-Nat

On May 9, 7:59*am, Nathaniel Calloway <n...@cornell.edu> wrote:
Sedgewick has implementations of Kosaraju's, Tarjan's and Gabow's
linear time algorithms. You can download the code from his site (but
using it commercially requires permission).
I have has graph algorithm book for C, and it is on pages 197-206.
The algorithm is also available in C++ and Java.

HTH.

"Nathaniel Calloway" <ntc6@cornell.edu> wrote in message
news:uzlqz7cbs.fsf@cornell.edu...
Since I was looking for code, I did not bother with any of the pdf's. Took
me less than 2 minutes.

It's actually quite an interesting problem and I am glad you brought it up.


** Posted from http://www.teranews.com **