Re: finding all cycles in a graph

[James Sherman Jr.]

He's referring (I believe) to a graph in the graph theory sense, where a graph is comprised of vertices and  edges (possibly) connecting those vertices.  A cycle in such a graph is a path that makes a "loop", IIRC, you can start at a particular vertex and then move along the edges of the graph to return back to the vertex where you started.

To the OP, I do not know of code to do this in Octave.

James Sherman

On Tue, Jan 24, 2012 at 2:08 PM, Doug Stewart <address@hidden> wrote:

On Tue, Jan 24, 2012 at 12:01 PM, Francesco Potortì <address@hidden> wrote:

Has anyone an Octave program for finding all cycles in a graph?

--
Francesco Potortì (ricercatore)        Voice:  +39.050.315.3058 (op.2111)
ISTI - Area della ricerca CNR          Mobile: +39.348.8283.107
via G. Moruzzi 1, I-56124 Pisa         Fax:    +39.050.315.2040
(entrance 20, 1st floor, room C71)     Web:    http://fly.isti.cnr.it
_______________________________________________
Help-octave mailing list
address@hidden
https://mailman.cae.wisc.edu/listinfo/help-octave

I am not sure what you are asking for?

--

DAS

https://linuxcounter.net/user/206392.html

_______________________________________________
Help-octave mailing list
address@hidden
https://mailman.cae.wisc.edu/listinfo/help-octave