_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
ghc-equivalence 0.4.1
Dependencies: ghc-stmonadtrans@0.4.7 ghc-transformers-compat@0.7.2 ghc-fail@4.9.0.0
Channel: guix
Location: gnu/packages/haskell-xyz.scm (gnu packages haskell-xyz)
Home page: https://github.com/pa-ba/equivalence
Licenses: Modified BSD
Synopsis: Maintaining an equivalence relation implemented as union-find
Description:

This is an implementation of Tarjan's Union-Find algorithm (Robert E.: Tarjan. "Efficiency of a Good But Not Linear Set Union Algorithm",JACM 22(2), 1975) in order to maintain an equivalence relation. This implementation is a port of the union-find package using the ST monad transformer (instead of the IO monad).

Total results: 1