summaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorUlrich Bauer <mail@ulrich-bauer.org>2019-06-29 14:32:38 +0200
committerUlrich Bauer <mail@ulrich-bauer.org>2019-06-29 14:32:38 +0200
commita75784e9731ef29bde14b15e697f4c112058b46c (patch)
tree6a227980af9f29b947a605e278412eb6a1e8b731 /README.md
parentbe5f5cb93477df12b388ff9af7ea1ac403be8356 (diff)
more updates and cleanup
Diffstat (limited to 'README.md')
-rw-r--r--README.md8
1 files changed, 5 insertions, 3 deletions
diff --git a/README.md b/README.md
index 3c556c0..46d1ca9 100644
--- a/README.md
+++ b/README.md
@@ -39,7 +39,7 @@ Ripser's efficiency is based on a few important concepts and principles, buildin
### Version
-[Latest release][latest-release]: 1.1 (June 2019)
+[Latest release][latest-release]: 1.1 (July 2019)
### Building
@@ -89,9 +89,11 @@ The input is given either in a file whose name is passed as an argument, or thro
### Experimental features
-The following features are currently planned for future versions:
+The following experimental features are currently available in separate branches:
- - computation of representative cycles for persistent homology (currenly only *co*cycles are computed)
+- `representative-cocycles`: output of representative cocycles for persistent cohomology.
+- `representative-cycles`: computation and output of representative cycles for persistent homology (in the standard version, only *co*cycles are computed).
+- `simple`: a simplified version of Ripser, without support for sparse distance matrices and coefficients. This might be a good starting point for exploring the code.
Prototype implementations are already avaliable; please contact the author if one of these features might be relevant for your research.