Skip to content
Go to file

Latest commit


Git stats


Failed to load latest commit information.
Latest commit message
Commit time


A topological data analysis library for Haskell.

This library is motivated by flexibility when it comes to the type of data being analyzed. If your data comes with a meaningful binary function into into an ordered set, you can use Persistence to analyze your data. The library also provides functions for analyzing directed/undirected, weighted/unweighted graphs.

Visit to see the documentation for the stable version. There is also documentation in each module.


If you have the Haskell stack tool installed, compile and run tests with stack test (you may have to expose the modules Util and Matrix in the file Persistence.cabal to get it to work).

Learning about Topological Data Analysis

Computing simplicial homology:

Constructing the Vietoris-Rips complex:

Constructing the Cech complex:

Computing persistent homology:

The algorithm for finding the directed clique complex is inspired by the pseudocode in the supplementary materials of this paper:

Computing and working with persistence landscapes:

Major TODOs:


  1. More tests for Persistence landscape functions.

  2. Make some filtrations whose vertices don't all have index 0 and test persistent homology on them.


  1. indexBarCodes and indexBarCodesSimple are both broken from the transition to unboxed vectors.


  1. Fix simplicial homology over the integers.

  2. Implement construction of the Cech complex (n points form an (n-1)-simplex if balls of a certain radius centered at each of the points intersect).

  3. Implement construction of the alpha-complex (sub-complex of the Delaunay triangulation where the vertices of every simplex are within a certain distance).


  1. This module ought to be completely rewritten for the sake of performance.

See each of the files for an overview of its inner-workings.