# Equivalence Classes

### Description

Calculates Equivalence Classes

### Usage

1 |

### Arguments

`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. |

### Details

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.

### Value

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).

### Examples

1 2 3 4 |

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker. Vote for new features on Trello.