# The union-find package

The Union/Find algorithm implements these operations in (effectively) constant-time:

1. Check whether two elements are in the same equivalence class.

2. Create a union of two equivalence classes.

3. Look up the descriptor of the equivalence class.

[Skip to ReadMe]

## Properties

Versions | 0.1, 0.2 |
---|---|

Change log | None available |

Dependencies | base (==4.*), containers (>=0.3), transformers (>=0.2) [details] |

License | BSD3 |

Author | Thomas Schilling <nominolo@googlemail.com> |

Maintainer | Thomas Schilling <nominolo@googlemail.com> |

Stability | provisional |

Category | Algorithms, Data |

Home page | http://github.com/nominolo/union-find |

Bug tracker | http://github.com/nominolo/union-find/issues |

Source repository | head: git clone git://github.com/nominolo/union-find |

Uploaded | Sat Jun 23 01:01:23 UTC 2012 by ThomasSchilling |

Distributions | Fedora:0.2, LTSHaskell:0.2, NixOS:0.2, Stackage:0.2 |

Downloads | 8709 total (17 in last 30 days) |

Votes | |

Status | Docs uploaded by user Build status unknown [no reports yet] |

## Modules

*Control**Monad*

*Data*

[Index]

## Downloads

- union-find-0.2.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees