disappearedng wrote:
Hey everyone,
I am interested to find out all the cycles within an undirected graph.
I think you have to qualify that as 'minimal cycles' to have a
well-defined problem.
--
http://mail.python.org/mailman/listinfo/python-list
Actually, I have realized that using the bit vector XOR method by
http://www.me.utexas.edu/~bard/IP/Handouts/cycles.pdf gives some
possibility of doing so. However this method is still experimental and
doesn't really have a definitive end to the algorithm (the base number
of vectors can change).
A
disappearedng wrote:
Hey everyone,
I am interested to find out all the cycles within an undirected graph.
I don't have a particular implementation of nodes and vertices yet, so
would someone kindly point out a good graph library for this ( I
looked at pygraph and python-graph, but not really sati
