[jgrapht-users] JGraphT cycle algorithms

[<fee...@gm...>]

Hi there,

Has anyone used any of the cycle algorithms provided by org.jgrapht.alg.cycle (Tarjan, Johnson, etc)??? 

I’m running a code to detect cycles on a graph with 216 vertices and 1861 edges. Unfortunately, I’ve not been able to get an answer  because of a Java heap space error….it's just running out memory very quickly!!

Have you guys gone through a similar situation??? …..or just my graph is too large?? 

As far as I know Tarjan, Johnson, Tiernan, and the others are very efficient procedures.

Thanks.


Phil