fixing numbering
@@ -43,7 +43,7 @@ graph may still contain disconnected components.
2. ``MST-min``: To achieve a connected graph, add the minimum number of edges from a maximum
spanning tree to the mutual-kNN graph that has been weighted with similarity-based
-metrics(Ozaki et al. 2011).We adapt this by calculating the minimum spanning tree for distances
+metrics(Ozaki et al. 2011). We adapt this by calculating the minimum spanning tree for distances.
3. ``MST-all``: Adding all the edges of the MST.
