Spelling corrections

Correction of some obvious spelling errors

9 files changed, 10 insertions, 10 deletions

diff --git a/src/Contraction/example/Rips_contraction.cpp b/src/Contraction/example/Rips_contraction.cpp
index 42dd0910..547c290e 100644
--- a/src/Contraction/example/Rips_contraction.cpp
+++ b/src/Contraction/example/Rips_contraction.cpp
@@ -39,7 +39,7 @@ void build_rips(ComplexType& complex, double offset) {
 int main(int argc, char *argv[]) {
   if (argc != 3) {
     std::cerr << "Usage " << argv[0] << " ../../../data/meshes/SO3_10000.off 0.3 to load the file " <<
-        "../../data/SO3_10000.off and contract the Rips complex built with paremeter 0.3.\n";
+        "../../data/SO3_10000.off and contract the Rips complex built with parameter 0.3.\n";
     return -1;
   }
 
diff --git a/src/Contraction/include/gudhi/Edge_contraction.h b/src/Contraction/include/gudhi/Edge_contraction.h
index 0b43c3b3..dff6dc14 100644
--- a/src/Contraction/include/gudhi/Edge_contraction.h
+++ b/src/Contraction/include/gudhi/Edge_contraction.h
@@ -48,7 +48,7 @@ Therefore, the simplification can be done without enumerating the set of simplic
 
 A typical application of this package is homology group computation. It is illustrated in the next figure where a Rips complex is built upon a set of high-dimensional points and
 simplified with edge contractions.
-It has initially a big number of simplices (around 20 millions) but simplifying it to a much reduced form with only 15 vertices (and 714 simplices) takes only few seconds on a desktop machine (see the example bellow).
+It has initially a big number of simplices (around 20 millions) but simplifying it to a much reduced form with only 15 vertices (and 714 simplices) takes only few seconds on a desktop machine (see the example below).
 One can then compute homology group with a simplicial complex having very few simplices instead of running the homology algorithm on the much bigger initial set of 
 simplices which would take much more time and memory.
 
diff --git a/src/GudhUI/view/Viewer_instructor.h b/src/GudhUI/view/Viewer_instructor.h
index 58cbcd31..09ed102f 100644
--- a/src/GudhUI/view/Viewer_instructor.h
+++ b/src/GudhUI/view/Viewer_instructor.h
@@ -11,7 +11,7 @@
 #ifndef VIEW_VIEWER_INSTRUCTOR_H_
 #define VIEW_VIEWER_INSTRUCTOR_H_
 
-// todo do a viewer instructor that have directely a pointer to a QGLviewer and buffer ot not triangles
+// todo do a viewer instructor that has directly a pointer to a QGLviewer and buffer ot not triangles
 
 #include <QFileDialog>
 #include <QKeyEvent>
diff --git a/src/Persistence_representations/test/persistence_lanscapes_test.cpp b/src/Persistence_representations/test/persistence_lanscapes_test.cpp
index 21ef18a0..59924f16 100644
--- a/src/Persistence_representations/test/persistence_lanscapes_test.cpp
+++ b/src/Persistence_representations/test/persistence_lanscapes_test.cpp
@@ -238,7 +238,7 @@ if ( argc != 2 )
         double integral = p.compute_integral_of_landscape();
         cout << "integral : " << integral <<endl;
 
-        //compute integral for each level separatelly
+        //compute integral for each level separately
         for ( size_t level = 0 ; level != p.size() ; ++level )
         {
                 cout << p.compute_integral_of_landscape( level ) << endl;
diff --git a/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h b/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h
index 2301a66b..c00bd33d 100644
--- a/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h
+++ b/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h
@@ -723,7 +723,7 @@ class Persistent_cohomology {
   boost::disjoint_sets<int *, Simplex_key *> dsets_;
   /* The compressed annotation matrix fields.*/
   Cam cam_;
-  /*  Dictionary establishing the correspondance between the Simplex_key of
+  /*  Dictionary establishing the correspondence between the Simplex_key of
    * the root vertex in the union-find ds and the Simplex_key of the vertex which
    * created the connected component as a 0-dimension homology feature.*/
   std::map<Simplex_key, Simplex_key> zero_cocycles_;
diff --git a/src/Skeleton_blocker/include/gudhi/Skeleton_blocker_complex.h b/src/Skeleton_blocker/include/gudhi/Skeleton_blocker_complex.h
index 8ceaa480..b4ffc756 100644
--- a/src/Skeleton_blocker/include/gudhi/Skeleton_blocker_complex.h
+++ b/src/Skeleton_blocker/include/gudhi/Skeleton_blocker_complex.h
@@ -1291,7 +1291,7 @@ class Skeleton_blocker_complex {
   typedef boost::iterator_range<Complex_neighbors_vertices_iterator> Complex_neighbors_vertices_range;
 
   /**
-   * @brief Returns a Complex_edge_range over all edges of the simplicial complex that passes trough v
+   * @brief Returns a Complex_edge_range over all edges of the simplicial complex that passes through v
    */
   Complex_neighbors_vertices_range vertex_range(Vertex_handle v) const {
     auto begin = Complex_neighbors_vertices_iterator(this, v);
diff --git a/src/Skeleton_blocker/include/gudhi/Skeleton_blocker_link_complex.h b/src/Skeleton_blocker/include/gudhi/Skeleton_blocker_link_complex.h
index a2637da3..b3bf0382 100644
--- a/src/Skeleton_blocker/include/gudhi/Skeleton_blocker_link_complex.h
+++ b/src/Skeleton_blocker/include/gudhi/Skeleton_blocker_link_complex.h
@@ -164,7 +164,7 @@ ComplexType> {
         Vertex_handle y_parent = *parent_complex.get_address(
                                                              this->get_id(*y_link));
         if (parent_complex.contains_edge(x_parent, y_parent)) {
-          // we check that there is no blocker subset of alpha passing trough x and y
+          // we check that there is no blocker subset of alpha passing through x and y
           bool new_edge = true;
           for (auto blocker_parent : parent_complex.const_blocker_range(
                                                                         x_parent)) {
diff --git a/src/cmake/modules/GUDHI_options.cmake b/src/cmake/modules/GUDHI_options.cmake
index 5e28c87d..8379e3c6 100644
--- a/src/cmake/modules/GUDHI_options.cmake
+++ b/src/cmake/modules/GUDHI_options.cmake
@@ -4,7 +4,7 @@ option(WITH_GUDHI_REMOTE_TEST "Activate/deactivate datasets fetching test which
 option(WITH_GUDHI_PYTHON "Activate/deactivate python module compilation and installation" ON)
 option(WITH_GUDHI_TEST "Activate/deactivate examples compilation and installation" ON)
 option(WITH_GUDHI_UTILITIES "Activate/deactivate utilities compilation and installation" ON)
-option(WITH_GUDHI_THIRD_PARTY "Activate/deactivate third party libraries cmake detection. When set to OFF, it is usefull for doxygen or user_version i.e." ON)
+option(WITH_GUDHI_THIRD_PARTY "Activate/deactivate third party libraries cmake detection. When set to OFF, it is useful for doxygen or user_version i.e." ON)
 
 if (NOT WITH_GUDHI_THIRD_PARTY)
   set (WITH_GUDHI_BENCHMARK OFF)
@@ -12,4 +12,4 @@ if (NOT WITH_GUDHI_THIRD_PARTY)
   set (WITH_GUDHI_PYTHON OFF)
   set (WITH_GUDHI_TEST OFF)
   set (WITH_GUDHI_UTILITIES OFF)
-endif()
\ No newline at end of file
+endif()
diff --git a/src/python/gudhi/tensorflow/cubical_layer.py b/src/python/gudhi/tensorflow/cubical_layer.py
index 3304e719..5df2c370 100644
--- a/src/python/gudhi/tensorflow/cubical_layer.py
+++ b/src/python/gudhi/tensorflow/cubical_layer.py
@@ -18,7 +18,7 @@ def _Cubical(Xflat, Xdim, dimensions, homology_coeff_field):
     cc = CubicalComplex(dimensions=Xdim[::-1], top_dimensional_cells=Xflat)
     cc.compute_persistence(homology_coeff_field=homology_coeff_field)
 
-    # Retrieve and ouput image indices/pixels corresponding to positive and negative simplices    
+    # Retrieve and output image indices/pixels corresponding to positive and negative simplices
     cof_pp = cc.cofaces_of_persistence_pairs()
     
     L_cofs = []