summaryrefslogtreecommitdiff
path: root/src/Bottleneck_distance/include/gudhi/Persistence_graph.h
diff options
context:
space:
mode:
authorMarc Glisse <marc.glisse@inria.fr>2020-10-17 23:29:39 +0200
committerMarc Glisse <marc.glisse@inria.fr>2020-10-17 23:29:39 +0200
commit911b589081831c98040448c489264fabfe8b5558 (patch)
tree67d23204b55ad5a9dd07e47c4312abd88260c8c3 /src/Bottleneck_distance/include/gudhi/Persistence_graph.h
parent27a488386c6a3b2b4dbac43534a36f18ef04ac80 (diff)
Handle diagrams with a single point
Diffstat (limited to 'src/Bottleneck_distance/include/gudhi/Persistence_graph.h')
-rw-r--r--src/Bottleneck_distance/include/gudhi/Persistence_graph.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/Bottleneck_distance/include/gudhi/Persistence_graph.h b/src/Bottleneck_distance/include/gudhi/Persistence_graph.h
index 04c7c118..33f03b9c 100644
--- a/src/Bottleneck_distance/include/gudhi/Persistence_graph.h
+++ b/src/Bottleneck_distance/include/gudhi/Persistence_graph.h
@@ -45,7 +45,7 @@ class Persistence_graph {
int corresponding_point_in_v(int u_point_index) const;
/** \internal \brief Given a point from U and a point from V, returns the distance between those points. */
double distance(int u_point_index, int v_point_index) const;
- /** \internal \brief Returns size = |U| = |V|. */
+ /** \internal \brief Returns size = |U| + |V|. */
int size() const;
/** \internal \brief Is there as many infinite points (alive components) in both diagrams ? */
double bottleneck_alive() const;