[Lemon-user] Lemon usage and cycles

[Pierre Moulon]

Hi,

First congratulation for the great lemon library contribution.

I have some question in order to obtain tips to realize some operation
under lemon, so I ask to the mailing list.

1. Considering a graph, I want to keep only the edge and nodes of the graph
that belong to cycles.

i.e:
  _____
_|___|
  |_|_|

Must give :
  ___
  |___|
  |_|_|

Do you have any ideas about algorithms to realize this objective ?
Removing node with 1 connexity can work bust must be iterated since the
1connexity is not satisfied on the graph. (iterative manner).
i.e : _.__._
Will remove the first edge and after a not cyling graph will remain.
 .__._
one more iteration
._.
one more iteration
All edges and nodes have been removed.

I think there can be better approach that are linear with the graph size.

2. Considering this loopy graph I want select many random cycle :

Any suggestion ?

Thanks in advance for any help of tips ;-)

-- 
Regards/Cordialement,
Pierre M
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20120801/5e3c2c48/attachment.html>