summaryrefslogtreecommitdiff
path: root/src/python/doc/wasserstein_distance_sum.inc
diff options
context:
space:
mode:
Diffstat (limited to 'src/python/doc/wasserstein_distance_sum.inc')
-rw-r--r--src/python/doc/wasserstein_distance_sum.inc4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/python/doc/wasserstein_distance_sum.inc b/src/python/doc/wasserstein_distance_sum.inc
index 0263f80f..3b0b9025 100644
--- a/src/python/doc/wasserstein_distance_sum.inc
+++ b/src/python/doc/wasserstein_distance_sum.inc
@@ -7,8 +7,8 @@
| :figclass: align-center | a perfect matching between the points of the two diagrams (+ all the | :Introduced in: GUDHI 2.0.0 |
| | diagonal points), where the value of a matching is defined as the | |
| Wasserstein distance is the p-th root of the sum of the | p-th root of the sum of all edges lengths to the power p. Edges | :Copyright: MIT (`GPL v3 </licensing/>`_) |
- | edges lengths to the power p. | lengths are measured in norm q, for $1 \leq q \leq \infty$. | |
- | | | :Requires: `Python Optimal Transport (POT)` |
+ | edges lengths to the power p. | lengths are measured in norm q, for :math:`1 \leq q \leq \infty`. | |
+ | | | :Requires: Python Optimal Transport (POT) :math:`\geq` 0.5.1 |
+-----------------------------------------------------------------+----------------------------------------------------------------------+------------------------------------------------------------------+
| * :doc:`wasserstein_distance_user` | |
+-----------------------------------------------------------------+-----------------------------------------------------------------------------------------------------------------------------------------+