find1cycle: Finds 1 cycle from the spanning tree.
In edahelsinki/cyclesampler: Randomization Algorithms for Large Sparse Matrices

Finds 1 cycle from the spanning tree.

1	find1cycle(bft, depth, idx, idx0, left, right)

`bft`	Spannig tree.
`depth`	depth of the items in spanning tree.
`idx`	Triplet indices of the links in spanning tree.
`idx0`	Cycle link that does not appear in the spanning tree.
`left`	triplets[idx0,1]
`right`	triplets[idx0,2]

Cycle extracted from the spanning tree.

edahelsinki/cyclesampler documentation built on June 9, 2019, 10:51 a.m.

edahelsinki/cyclesampler index

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description