We don't currently supply an algorithm which enumerates all the cycles.
Keep in mind that for a complete graph with n nodes, there are n!
different cycles, so that enumeration could take a looooong time.
JVS
Rui Chang wrote:
> Hi all,
> I am a newbie in using JGraphT. So, please forgive me if my question is
> too easy.
> I have a directed graph containing many cycles, and I'd like to use
> JGraphT to find all these cycles (nodes in the cycle) in this directed
> graph. I am now trying to use the class: StrongConnectivityInspector and
> its methods: stronglyConnectedSubgraphs. However, it will not return all
> cycles.
>
> Is there a way to use any class in JGraphT to find all cycles?
>
> Thanks!
> Rui
>
> ------------------------------------------------------------------------
> The New Busy is not the old busy. Search, chat and e-mail from your
> inbox. Get started.
> <http://www.windowslive.com/campaign/thenewbusy?ocid=PID27925::T:WLMTAGL:ON:WL:en-US:WM_HMP:032010_3>
>
>
> ------------------------------------------------------------------------
>
> ------------------------------------------------------------------------------
> Download Intel® Parallel Studio Eval
> Try the new software tools for yourself. Speed compiling, find bugs
> proactively, and fine-tune applications for parallel performance.
> See why Intel Parallel Studio got high marks during beta.
> http://p.sf.net/sfu/intel-sw-dev
>
>
> ------------------------------------------------------------------------
>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
|
