diff options
author | Vincent Rouvreau <10407034+VincentRouvreau@users.noreply.github.com> | 2020-04-04 07:59:01 +0200 |
---|---|---|
committer | GitHub <noreply@github.com> | 2020-04-04 07:59:01 +0200 |
commit | c0d052e1c845db11f557317c8d2a2927df2f0a55 (patch) | |
tree | fa198eec7225c2bed7b212488cca7b7410df1875 | |
parent | 2f46606b406aafc69e37a68dca33e1858ab7b817 (diff) | |
parent | 115dacbd482a75b304c0f44ef84d59f8d141c1df (diff) |
Merge pull request #271 from tlacombe/patch-1
Update next_release.md
-rw-r--r-- | .github/next_release.md | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/.github/next_release.md b/.github/next_release.md index 3166b0a8..83b98a1c 100644 --- a/.github/next_release.md +++ b/.github/next_release.md @@ -9,6 +9,7 @@ Below is a list of changes made since GUDHI 3.1.1: - [Wassertein distance](https://gudhi.inria.fr/python/latest/wasserstein_distance_user.html) - An another implementation comes from Hera (BSD-3-Clause) which is based on [Geometry Helps to Compare Persistence Diagrams](http://doi.acm.org/10.1145/3064175) by Michael Kerber, Dmitriy Morozov, and Arnur Nigmetov. + - `gudhi.wasserstein.wasserstein_distance` has now an option to return the optimal matching that achieves the distance between the two diagrams. - [Module](link) - ... |