- First version. Released on an unsuspecting world.
- Bottleneck distance, a way to compare the topology of different data sets.
- HasseDiagram module, will allow users to deduce topological features of information flow in networks.
- A function for encoding generic graphs as 2D vectors.
- Improved documentation for all exposed modules.
- Fixed a major bug with persistent homology; high dimensional holes were being detected in low dimensional data sets.
- Persistent homology now filters out bar codes of the form (i, Just i), as they say nothing about the topology of the underlying complexes.
- Fixed spelling error.
- Persistence now exports the constructors for
Extended a
.
- Fixed all spelling errors, should actually build now.
- Fixed non-exhaustive pattern match in
BottleNeckDistance
functions.
-
The module
Persistence
has been renamed toFiltration,
and all modules now exist withinPersistence
. -
Bar codes now take a type as a parameter so that they can not only represent the filtration indices at which features appear but also the scales.
-
Persistent homology functions now take data sets as either vectors or lists.
-
Fixed minor issue with bottleneck distance and removed the unsafe functions.
-
Improved documentation for all exposed modules
-
Extended
type now exports its constructors.
-
Simplex type synonyms for making other type synonyms and signatures more readable.
-
Data structures for filtrations both with and without all vertices having filtration index equal to zero, and persistent homology functions for processing each structure.
-
Persistent homology functions that return Bar codes in terms of scales.
-
Functions for constructing and manipulating persistence landscapes.
- Representation of graphs now takes half as much memory.
-
Module for constructing graphs.
-
More efficient algorithms for constructing the neighborhood graph.
-
Algorithms for dealing with sets of trajectories in Euclidean space.
- Distance types must now be unboxed.