Calculates Equivalence Classes

1 |

`from` |
an atomic vector |

`to` |
an atomic vector of the same mode and length as |

`domain` |
an atomic vector of the same mode as |

`markers` |
controls the type of result; see Values below. |

Pairs `(from[i], to[i])`

can be though of either as elements of
a symmetric relation on a set or as edges in an undirected graph.
This function calculates the equivalence classes of the transitive
closure of the relation or the components of the graph. If the edges
are thought of as directed, then we calculate the weak components,
meaning the components of the associated undirected graph, rather than
the so-called strong components of the directed graph.

If `markers = FALSE`

,
a list, elements of which are the components (equivalence classes).
If `markers = TRUE`

, an integer vector of the same length as
`domain`

or as `union(from, to)`

if `domain`

is missing,
elements of which are the same if and only if the corresponding elements
of the domain (nodes of the graph) are in the same connected component
(equivalence class).

1 2 3 4 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.