Pardon the interruption, but are you taking advantage of the well known depth first search, rooted tree growing search that produces a complete basis for all cycles in a connected graph? From there you can go on to various exchange system (matroids) if you've a mind to. There's a lot of work done and documented in this area. J routines could be organized to deal with linear bases and basis exchange methods. Just an observation.
On Thursday, August 25, 2016, R.E. Boss <r.e.b...@outlook.com> 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 -- Sent from Gmail Mobile ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
