Merge remote-tracking branch 'upstream/master' into cech_optimization

6 files changed, 6 insertions, 6 deletions

diff --git a/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp b/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp
index 030b072a..3bec8830 100644
--- a/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp
+++ b/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp
@@ -49,7 +49,7 @@ void timing_persistence(FilteredComplex & cpx
  * with a Hasse diagram. The Hasse diagram represents explicitly all 
  * codimension 1 incidence relations in the complex, and hence leads to 
  * a faster computation of persistence because boundaries are precomputed. 
- * Hovewer, the simplex tree may be constructed directly from a point cloud and
+ * However, the simplex tree may be constructed directly from a point cloud and
  * is more compact.
  * We compute persistent homology with coefficient fields Z/2Z and Z/1223Z.
  * We present also timings for the computation of multi-field persistent 
diff --git a/src/Persistent_cohomology/concept/FilteredComplex.h b/src/Persistent_cohomology/concept/FilteredComplex.h
index 26ac7ac8..59ce25e3 100644
--- a/src/Persistent_cohomology/concept/FilteredComplex.h
+++ b/src/Persistent_cohomology/concept/FilteredComplex.h
@@ -103,7 +103,7 @@ Filtration_simplex_range filtration_simplex_range();
 /** @} */
  
 
-/* \brief Iterator over the simplices of the complex,
+/** \brief Iterator over the simplices of the complex,
   * in an arbitrary order.
   *
   * 'value_type' must be 'Simplex_handle'.*/
diff --git a/src/Persistent_cohomology/example/custom_persistence_sort.cpp b/src/Persistent_cohomology/example/custom_persistence_sort.cpp
index 410cd987..bba0b2f7 100644
--- a/src/Persistent_cohomology/example/custom_persistence_sort.cpp
+++ b/src/Persistent_cohomology/example/custom_persistence_sort.cpp
@@ -33,7 +33,7 @@ using Persistent_cohomology = Gudhi::persistent_cohomology::Persistent_cohomolog
       Gudhi::persistent_cohomology::Field_Zp >;
 
 std::vector<Point> random_points() {
-  // Instanciate a random point generator
+  // Instantiate a random point generator
   CGAL::Random rng(0);
 
   // Generate "points_number" random points in a vector
diff --git a/src/Persistent_cohomology/example/persistence_from_simple_simplex_tree.cpp b/src/Persistent_cohomology/example/persistence_from_simple_simplex_tree.cpp
index bffaabdd..3da6771e 100644
--- a/src/Persistent_cohomology/example/persistence_from_simple_simplex_tree.cpp
+++ b/src/Persistent_cohomology/example/persistence_from_simple_simplex_tree.cpp
@@ -95,7 +95,7 @@ int main(int argc, char * const argv[]) {
   SimplexVector = {9, 10, 11};
   st.insert_simplex_and_subfaces(SimplexVector, 0.3);
 
-  // ++ NINETH
+  // ++ NINTH
   std::clog << "   - INSERT (2,10,12)" << std::endl;
   SimplexVector = {2, 10, 12};
   st.insert_simplex_and_subfaces(SimplexVector, 0.3);
diff --git a/src/Persistent_cohomology/example/rips_multifield_persistence.cpp b/src/Persistent_cohomology/example/rips_multifield_persistence.cpp
index 2edf5bc4..ca26a5b9 100644
--- a/src/Persistent_cohomology/example/rips_multifield_persistence.cpp
+++ b/src/Persistent_cohomology/example/rips_multifield_persistence.cpp
@@ -104,7 +104,7 @@ void program_options(int argc, char * argv[]
       ("min-field-charac,p", po::value<int>(&min_p)->default_value(2),
        "Minimal characteristic p of the coefficient field Z/pZ.")
       ("max-field-charac,q", po::value<int>(&max_p)->default_value(1223),
-       "Minimial characteristic q of the coefficient field Z/pZ.")
+       "Maximal characteristic q of the coefficient field Z/pZ.")
       ("min-persistence,m", po::value<Filtration_value>(&min_persistence),
        "Minimal lifetime of homology feature to be recorded. Default is 0");
 
diff --git a/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h b/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h
index d428e497..2301a66b 100644
--- a/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h
+++ b/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h
@@ -211,7 +211,7 @@ class Persistent_cohomology {
   /** \brief Update the cohomology groups under the insertion of an edge.
    *
    * The 0-homology is maintained with a simple Union-Find data structure, which
-   * explains the existance of a specific function of edge insertions. */
+   * explains the existence of a specific function of edge insertions. */
   void update_cohomology_groups_edge(Simplex_handle sigma) {
     Simplex_handle u, v;
     boost::tie(u, v) = cpx_->endpoints(sigma);