ccl_cycles: Connected component border vertice paths.

In Thell/ccloutline: Connected Component Labelling and Eulerian Cycle Outlines.

Description

Connected component grid graph vertice paths for each eulerian cycle for each component.

Usage

ccl_cycles(m, reverse = FALSE)

Arguments

m	A two dimensional numeric matrix.
reverse	Begin at the minimal column major indexed vertex.

Details

There is a slight performance hit with 'reverse' as this forces a scan of the vertices for the minimal remaining valued vertice and reorders the final results.

Value

Nested list of lists of arrays for all outlines of each component such that ccl_cycles(mat)[[label]][[id]] yields an array in the form of [ v_1, v_2, v_3, ... , v_1].

Each [[label]] index consists of at least 1 path and if the component has holes there is an additional path for each hole.

Thell/ccloutline documentation built on July 10, 2020, 2:46 a.m.