I was just wondering if 1 2 4 6 5 3 2 1 is considered a cycle since 2 is traversed twice. I would think not.
Louis > On 25 Aug 2016, at 13:42, R.E. Boss <[email protected]> wrote: > > It's not a directed cycle > > (1+i.26) /:~"1|: ({.,#)/.~ , edges > 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 > 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 > > R.E. Boss > > >> -----Original Message----- >> From: Programming [mailto:[email protected]] >> On Behalf Of Raul Miller >> Sent: donderdag 25 augustus 2016 13:23 >> To: Programming forum <[email protected]> >> Subject: Re: [Jprogramming] determine the cycle >> >> That is not a cycle. >> >> (1+i.26) -. {."1 edges >> 8 19 24 >> >> -- >> Raul >> >> >> On Thu, Aug 25, 2016 at 6:13 AM, R.E. Boss <[email protected]> wrote: >>> Given the edges in a graph which is a cycle, like >>> edges >>> 1 2 >>> 3 1 >>> 2 4 >>> 4 5 >>> 5 6 >>> 6 7 >>> 7 8 >>> 9 8 >>> 10 9 >>> 11 10 >>> 11 12 >>> 12 13 >>> 14 15 >>> 15 16 >>> 17 3 >>> 18 17 >>> 18 19 >>> 20 19 >>> 20 21 >>> 21 22 >>> 22 14 >>> 16 23 >>> 13 24 >>> 25 24 >>> 26 25 >>> 23 26 >>> Vertices of the graph are represented by >:i.26 >>> Question is how to determine in an elegant way the sequence of vertices >> along the cycle, which is >>> 1 2 4 5 6 7 8 9 10 11 12 13 24 25 26 23 16 15 14 22 21 20 19 18 17 3 1 >>> >>> >>> R.E. Boss >>> >>> >>> ---------------------------------------------------------------------- >>> For information about J forums see >> http://www.jsoftware.com/forums.htm >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
