I going to try some experiments on random graphs, however I stuke with problem of determining size of the largest cycle. I know that flow algorithms can detect cycle but not the lenght of the largest. Best would be to find algorithm and its implementation in some library, or program. Thanks in advance for help G.