diff options
| author | tlacombe <lacombe1993@gmail.com> | 2021-04-12 19:48:57 +0200 |
|---|---|---|
| committer | tlacombe <lacombe1993@gmail.com> | 2021-04-12 19:48:57 +0200 |
| commit | bb0792ed7bfe9d718be3e8039e8fb89af6d160e5 (patch) | |
| tree | 087c453546b5259a1621e13c0ad590eede97d996 /src/python/doc/wasserstein_distance_user.rst | |
| parent | cdab3c9e32923f83d25d2cdf207f3cddbb3f94f6 (diff) | |
added warning when cost is infty and matching is None
Diffstat (limited to 'src/python/doc/wasserstein_distance_user.rst')
| -rw-r--r-- | src/python/doc/wasserstein_distance_user.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/python/doc/wasserstein_distance_user.rst b/src/python/doc/wasserstein_distance_user.rst index b3d17495..091c9fd9 100644 --- a/src/python/doc/wasserstein_distance_user.rst +++ b/src/python/doc/wasserstein_distance_user.rst @@ -100,7 +100,7 @@ any matching has a cost +inf and thus can be considered to be optimal. In such a print("matchings:", matchings) -The output is: +The output is: .. testoutput:: @@ -197,4 +197,4 @@ Tutorial This `notebook <https://github.com/GUDHI/TDA-tutorial/blob/master/Tuto-GUDHI-Barycenters-of-persistence-diagrams.ipynb>`_ -presents the concept of barycenter, or Fréchet mean, of a family of persistence diagrams.
\ No newline at end of file +presents the concept of barycenter, or Fréchet mean, of a family of persistence diagrams. |