Persistence: A versatile library for topological data analysis.
A topological data analysis library 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. See the README for resources on learning about topological data anlysis.
[Skip to Readme]
- Persistence-2.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
|Versions [RSS]||1.0, 1.1, 1.1.1, 1.1.2, 1.1.3, 1.1.4, 22.214.171.124, 126.96.36.199, 2.0, 2.0.1, 2.0.2, 2.0.3|
|Dependencies||base (>=4.0 && <4.13), containers (>0.5), maximal-cliques (>=0.1), parallel (>=3.2 && <3.3), vector (>=0.12) [details]|
|Copyright||2019 Eben Kadile|
|Revised||Revision 1 made by Ebanflo at 2019-07-16T05:43:27Z|
|Source repo||head: git clone https://github.com/Ebanflo42/Persistence|
|Uploaded||by Ebanflo at 2019-07-16T05:22:43Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||5927 total (6 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2019-07-16 [all 1 reports]