Re: [jgrapht-users] cycles in an undirected graph

[Joris K. <de...@gm...>]

Have you actually tried Googling how to find a cycles in a graph...
this usually helps a lot ;).

Quick answer: run a depth first search on your node. (A depth first
search algorithm is included in the jgraph package). If the depth
first search algorithm re-encounters a node, then you know that there
is a cycle. Check for example these slides :
www.cs.sunysb.edu/~algorith/video-lectures/2007/lecture12.pdf

br,

Joris

On Tue, Aug 2, 2011 at 6:17 PM, zara75 <con...@gm...> wrote:
> I need to find all cycles in an undirected graph, and all cycles passing from
> a given node /e/, also in  an
> undirected graph.
>
> I would appreciate any help
>
>
> A.
>
>
> --
> View this message in context: http://jgrapht-users.107614.n3.nabble.com/cycles-in-an-undirected-graph-tp3219434p3219434.html
> Sent from the jgrapht-users mailing list archive at Nabble.com.
>
> ------------------------------------------------------------------------------
> BlackBerry&reg; DevCon Americas, Oct. 18-20, San Francisco, CA
> The must-attend event for mobile developers. Connect with experts.
> Get tools for creating Super Apps. See the latest technologies.
> Sessions, hands-on labs, demos & much more. Register early & save!
> http://p.sf.net/sfu/rim-blackberry-1
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>