homepage: ''
changelog-type: markdown
hash: f83a169be832e51d14b5b7e8c7dca17e057fad8049c4349ed28b6cac41f509e9
test-bench-deps: {}
maintainer: eben.cowley42@gmail.com
synopsis: Quickly detect clusters and holes in data.
changelog: ! '# Revision history for Persistence


  ## 1.0  -- YYYY-mm-dd


  * First version. Released on an unsuspecting world.

'
basic-deps:
  base: ! '>=4.10 && <4.11'
  containers: ! '>=0.5 && <0.6'
  maximal-cliques: ! '>=0.1 && <0.2'
  parallel: ! '>=3.2 && <3.3'
  vector: ! '>=0.12 && <0.13'
all-versions:
- '1.0'
author: Eben Cowley
latest: '1.0'
description-type: haddock
description: Persistence is a topological data analysis library motivated by flexibility
  when it comes to the type of data being analyzed. If you have data that comes with
  a meaningful function into something of the Ord typeclass, you can use Persistence
  to detect clusters and holes in the data. You can also use the library to analyze
  undirected graphs, and interesting features for directed graphs will be added soon.
license-name: BSD3

Update from Hackage at 2018-05-11T22:49:37Z
Update from Hackage at 2018-05-11T22:49:37Z
