From: "Noé Alejandro" <casanejo@...>
Date: 2010-10-10T01:21:47+09:00
Subject: Finding all cycles in a directed graph

Hello everybody.

I need to find all the cycles in a directed graph. For example:
A->B->C->A

I know about some algorithms as used by Donald B. Johnson, Chang Liu and
Lu Ruan, Tarjan, Gabows or Kosaraju and so on, but does anyone know a
ruby implementation of any of this algorithms?

Actually, I'm using the Ruby Graph Library (RGL), but its not efficient
(O(n^4)... it last 10 to 15 minutes to find the cycles in a graph with
33000 edges).

Thanks in advance.
-- 
Posted via http://www.ruby-forum.com/.