Spelling changes

README.md

@@ -74,7 +74,7 @@ streaming graph algorithms! Drop us a message on the channels below:
     <img src="https://img.shields.io/badge/Discord-7289DA?style=for-the-badge&logo=discord&logoColor=white" alt="Discord"/>
 </a>
 <a href="https://github.com/memgraph">
-    <img src="https://img.shields.io/badge/Memgraph_GitHub-181717?style=for-the-badge&logo=github&logoColor=white" alt="Memgraph Github"/>
+    <img src="https://img.shields.io/badge/Memgraph_GitHub-181717?style=for-the-badge&logo=github&logoColor=white" alt="Memgraph GitHub"/>
 </a>
 <a href="https://www.youtube.com/channel/UCZ3HOJvHGxtQ_JHxOselBYg">
     <img src="https://img.shields.io/badge/YouTube-FF0000?style=for-the-badge&logo=youtube&logoColor=white" alt="Memgraph YouTube"/>
@@ -146,7 +146,7 @@ docker run -p 7687:7687 -p 7444:7444 memgraph/memgraph-mage
 
 #### 2 Install MAGE with Docker build of the repository
 
-**0. a** Make sure that you have cloned the MAGE Github repository and positioned
+**0. a** Make sure that you have cloned the MAGE GitHub repository and positioned
 yourself inside the repo in your terminal:
 
 ```bash

cpp/betweenness_centrality_module/algorithm_online/betweenness_centrality_online.hpp

@@ -188,7 +188,7 @@ class OnlineBC {
   ///
   inline bool Initialized() const { return this->initialized; };
 
-  ///@brief Computes initial betweennness centrality scores with Brandes’ algorithm.
+  ///@brief Computes initial betweenness centrality scores with Brandes’ algorithm.
   ///
   ///@param graph Current graph
   ///@param normalize If true, normalizes each node’s betweenness centrality score by the number of node pairs not
@@ -200,8 +200,8 @@ class OnlineBC {
   std::unordered_map<std::uint64_t, double> Set(const mg_graph::GraphView<> &graph, const bool normalize = true,
                                                 const std::uint64_t threads = std::thread::hardware_concurrency());
 
-  ///@brief Returns previously computed betweennness centrality scores.
-  /// If this->computed flag is set to false, computes betweennness centrality scores with default parameter values.
+  ///@brief Returns previously computed betweenness centrality scores.
+  /// If this->computed flag is set to false, computes betweenness centrality scores with default parameter values.
   ///
   ///@param graph Current graph
   ///@param normalize If true, normalizes each node’s betweenness centrality score by the number of node pairs not
@@ -211,7 +211,7 @@ class OnlineBC {
   ///@return {node ID, BC score} pairs
   std::unordered_map<std::uint64_t, double> Get(const mg_graph::GraphView<> &graph, const bool normalize = true) const;
 
-  ///@brief Uses iCentral to recompute betweennness centrality scores after edge updates.
+  ///@brief Uses iCentral to recompute betweenness centrality scores after edge updates.
   ///
   ///@param prior_graph Graph as before the last update
   ///@param current_graph Current graph
@@ -228,7 +228,7 @@ class OnlineBC {
       const std::pair<std::uint64_t, std::uint64_t> updated_edge, const bool normalize = true,
       const std::uint64_t threads = std::thread::hardware_concurrency());
 
-  ///@brief Uses a single iteration of Brandes’ algorithm to recompute betweennness centrality scores after updates
+  ///@brief Uses a single iteration of Brandes’ algorithm to recompute betweenness centrality scores after updates
   /// consisting of an edge and a node solely connected to it.
   ///
   ///@param current_graph Current graph

cpp/betweenness_centrality_module/betweenness_centrality_online_module.cpp

@@ -137,7 +137,7 @@ void Update(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *result, mgp_m
 
       // Check if online update can be used
       if (created_nodes.size() == 0 && deleted_nodes.size() == 0) {  // Edge update
-        // Get edges as before before the update
+        // Get edges as before the update
         std::vector<std::pair<std::uint64_t, std::uint64_t>> prior_edges_ids;
         for (const auto edge_inner_ids : graph->Edges()) {
           const std::pair<std::uint64_t, std::uint64_t> edge{graph->GetMemgraphNodeId(edge_inner_ids.from),

cpp/community_detection_module/grappolo/BasicCommunitiesDetection/parallelLouvainMethodApprox-2.cpp

@@ -65,7 +65,7 @@ double parallelLouvianMethodApprox2(graph *G, mgp_graph *mg_graph, long *C, int
 #endif
     double time1, time2, time3, time4; //For timing purposes
     double total = 0, totItr = 0;
-    //long percentange = clustering_parameters.percentage;
+    //long percentage = clustering_parameters.percentage;
     long    NV        = G->numVertices;
     long    NS        = G->sVertices;
     long    NE        = G->numEdges;

cpp/community_detection_module/grappolo/BasicCommunitiesDetection/parallelLouvainMethodApprox.cpp

@@ -64,7 +64,7 @@ double parallelLouvianMethodApprox(graph *G, mgp_graph *mg_graph, long *C, int n
 #endif
   double time1, time2, time3, time4; //For timing purposes
   double total = 0, totItr = 0;
-  //long percentange = clustering_parameters.percentage;
+  //long percentage = clustering_parameters.percentage;
   long    NV        = G->numVertices;
   long    NS        = G->sVertices;
   long    NE        = G->numEdges;
@@ -201,7 +201,7 @@ int x = NV*percentage/100;
 		Counter.clear();
 
            }else {
-                         targetCommAss[i]=currCommAss[i];//(int)rand()%(NV*percentange/100);
+                         targetCommAss[i]=currCommAss[i];//(int)rand()%(NV*percentage/100);	
 		  }
 		//Update
 		if(targetCommAss[i] != currCommAss[i]  && targetCommAss[i] != -1) {

cpp/community_detection_module/grappolo/BasicCommunitiesDetection/runDirectedMultiPhaseBasic.cpp

@@ -88,7 +88,7 @@ void runMultiPhaseBasicDirected(graph *G, mgp_graph *mg_graph, long *C_orig, int
         totTimeClustering += tmpTime;
         totItr += tmpItr;
 
-        //Renumber the clusters contiguiously
+        //Renumber the clusters contiguously
         numClusters = renumberClustersContiguously(C, G->numVertices);
 
         //Keep track of clusters in C_orig
@@ -187,7 +187,7 @@ void runMultiPhaseBasicOnceDirected(graph *G, mgp_graph *mg_graph, long *C_orig,
         totTimeClustering += tmpTime;
         totItr += tmpItr;
 
-        //Renumber the clusters contiguiously
+        //Renumber the clusters contiguously
         numClusters = renumberClustersContiguously(C, G->numVertices);
 
         //Keep track of clusters in C_orig

cpp/community_detection_module/grappolo/BasicCommunitiesDetection/runMultiPhaseBasic.cpp

@@ -89,7 +89,7 @@ void runMultiPhaseBasic(graph *G, mgp_graph *mg_graph, long *C_orig, int basicOp
         totTimeClustering += tmpTime;
         totItr += tmpItr;
 
-        //Renumber the clusters contiguiously
+        //Renumber the clusters contiguously
         numClusters = renumberClustersContiguously(C, G->numVertices);
         //Keep track of clusters in C_orig
         if(phase == 1) {
@@ -186,7 +186,7 @@ void runMultiPhaseBasicOnce(graph *G, mgp_graph *mg_graph, long *C_orig, int bas
         totTimeClustering += tmpTime;
         totItr += tmpItr;
 
-        //Renumber the clusters contiguiously
+        //Renumber the clusters contiguously
         numClusters = renumberClustersContiguously(C, G->numVertices);
 
         //Keep track of clusters in C_orig

cpp/community_detection_module/grappolo/BasicCommunitiesDetection/runMultiPhaseBasicApprox.cpp

@@ -56,7 +56,7 @@ void runMultiPhaseBasicApprox(graph *G, mgp_graph *mg_graph, long *C_orig, int b
     int tmpItr=0, totItr = 0;
     long NV = G->numVertices;
 
-    long percentange = 80;
+    long percentage = 80;
     /* Step 1: Find communities */
     double prevMod = -1;
     double currMod = -1;
@@ -87,7 +87,7 @@ void runMultiPhaseBasicApprox(graph *G, mgp_graph *mg_graph, long *C_orig, int b
         totTimeClustering += tmpTime;
         totItr += tmpItr;
 
-        //Renumber the clusters contiguiously
+        //Renumber the clusters contiguously
         numClusters = renumberClustersContiguously(C, G->numVertices);
 
         //Keep track of clusters in C_orig

cpp/community_detection_module/grappolo/CMakeLists.txt

@@ -1,7 +1,7 @@
 # Nitin A. Gawande, PNNL
 # Oct 19, 2018
 
-# set varaibles using nomenclature used in Makefile
+# set variables using nomenclature used in Makefile
 set(MODULE_DIR community_detection_module/grappolo)
 set(COFOLDER BasicCommunitiesDetection)
 set(UTFOLDER Utility)

cpp/community_detection_module/grappolo/Coloring/parallelLouvainWithColoring.cpp

@@ -63,14 +63,14 @@ double algoLouvainWithDistOneColoring(graph* G, mgp_graph *mg_graph, long *C, in
 
     double time1, time2, time3, time4; //For timing purposes
     double total = 0, totItr = 0;
-    /* Indexs are vertex */
+    /* Indexes are vertex */
     long* pastCommAss;	//Store previous iteration's community assignment
     long* currCommAss;	//Store current community assignment
     //long* targetCommAss;	//Store the target of community assignment
     double* vDegree;	//Store each vertex's degree
     double* clusterWeightInternal;//use for Modularity calculation (eii)
 
-    /* Indexs are community */
+    /* Indexes are community */
     Comm* cInfo;	 //Community info. (ai and size)
     Comm* cUpdate; //use for updating Community
 

cpp/community_detection_module/grappolo/Coloring/parallelLouvainWithColoringNoMap.cpp

@@ -62,14 +62,14 @@ double algoLouvainWithDistOneColoringNoMap(graph* G, long *C, int nThreads, int*
 
 	double time1, time2, time3, time4; //For timing purposes
 	double total = 0, totItr = 0;
-	/* Indexs are vertex */
+	/* Indexes are vertex */
 	long* pastCommAss;	//Store previous iteration's community assignment
 	long* currCommAss;	//Store current community assignment
 	//long* targetCommAss;	//Store the target of community assignment
   double* vDegree;	//Store each vertex's degree
 	double* clusterWeightInternal;//use for Modularity calculation (eii)
 
-	/* Indexs are community */
+	/* Indexes are community */
 	Comm* cInfo;	 //Community info. (ai and size)
 	Comm* cUpdate; //use for updating Community
 

cpp/community_detection_module/grappolo/Coloring/runMultiPhaseColoring.cpp

@@ -119,7 +119,7 @@ void runMultiPhaseColoring(graph *G, mgp_graph *mg_graph, long *C_orig, int colo
             totItr += tmpItr;
             nonColor = true;
         }
-        //Renumber the clusters contiguiously
+        //Renumber the clusters contiguously
         numClusters = renumberClustersContiguously(C, G->numVertices);
 
         //Keep track of clusters in C_orig

cpp/community_detection_module/grappolo/Coloring/vBase.cpp

@@ -2,7 +2,7 @@
 #include "defs.h"
 #include "coloring.h"
 
-/* The redistritbuted coloring step, no balance */
+/* The redistributed coloring step, no balance */
 int vBaseRedistribution(graph* G, int* vtxColor, int ncolors, int type)
 {
 #ifdef PRINT_DETAILED_STATS_
@@ -81,7 +81,7 @@ int vBaseRedistribution(graph* G, int* vtxColor, int ncolors, int type)
 		if(freq[ci]>avg)
 			overSize[ci]= true;
 
-	/* Begining of Redistribution */
+	/* Beginning of Redistribution */
 	std::cout << "VR start "<< std::endl;
 
 

cpp/community_detection_module/grappolo/DefineStructure/basic_util.h

@@ -1,5 +1,5 @@
-#ifndef __UTILITLY__
-#define __UTILITLY__
+#ifndef __UTILITY__
+#define __UTILITY__
 
 // Define in buildNextPhase.cpp
 long renumberClustersContiguously(long *C, long size);

cpp/community_detection_module/grappolo/DefineStructure/coloring.h

@@ -14,7 +14,7 @@ int algoColoringMultiHashMaxMin(graph *G, int *vtxColor, int nThreads, double *t
 // In vBase.cpp
 int vBaseRedistribution(graph* G, int* vtxColor, int ncolors, int type);
 
-// In equtiableColoringDistanceOne.cpp
+// In equitableColoringDistanceOne.cpp
 void buildColorSize(long NVer, int *vtxColor, int numColors, long *colorSize);
 void computeVariance(long NVer, int numColors, long *colorSize);
 

cpp/community_detection_module/grappolo/DefineStructure/coloringUtils.h

@@ -43,7 +43,7 @@ void distanceOneConfResolution(graph* G, long v, int* vtxColor, double* randValu
 void distanceOneChecked(graph* G, long nv ,int* colors);
 void buildColorsIndex(int* colors, const int numColors, const long nv, ColorVector& colorPtr,  ColorVector& colorIndex, ColorVector& binSizes);
 
-/******* UtiliyFunctions *****
+/******* UtilityFunctions *****
 void computeBinSizes(ColorVector &binSizes, const ColorVector &colors, const GraphElem nv, const ColorElem numColors);
 ColorElem getDegree(const GraphElem ci, const Graph &g);
 void computeBinSizesWeighted(ColorVector &binSizes, const ColorVector &colors, const GraphElem nv, const ColorElem numColors, const Graph &g);
@@ -67,7 +67,7 @@ void generateRandomNumbers(std::vector<double> &randVec);
 
 /* Basic coloring (unbalanced) in initialColoring.cpp
 ColorElem initColoring(const Graph &g, ColorVector &colors, std::string input);
-/* Basic coloiring (ab-inital) in initialColoringLU.cpp
+/* Basic coloring (ab-inital) in initialColoringLU.cpp
 ColorElem initColoringLU(const Graph &g, ColorVector &colors, std::string input);
 
 /* Vertex base redistribution in vBase.cpp

cpp/community_detection_module/grappolo/DefineStructure/utilityGraphPartitioner.h

@@ -186,7 +186,7 @@ void MetisGraphPartitioner( graph *G, long *VertexPartitioning, int numParts ) {
      VertexPartitioning[i] = (long) part[i]; //Do explicit typecasts
   }
 
-  //Cleaup:
+  //Cleanup:
   free(xadj); free(adjncy); free(adjwgt);
   free(part);
 }

cpp/community_detection_module/grappolo/DefineStructure/utilityNestedDisectionMetis.h

@@ -39,8 +39,8 @@
 //
 // ************************************************************************
 
-#ifndef _graph_NestDisect_
-#define _graph_NestDisect_
+#ifndef _graph_NestDissect_
+#define _graph_NestDissect_
 
 /*
  int METIS NodeND(idx t *nvtxs, idx t *xadj, idx t *adjncy, idx t *vwgt, idx t *options,
@@ -165,7 +165,7 @@ void MetisNDReorder( graph *G, long *old2NewMap ) {
         old2NewMap[i] = (long) perm[i]; //Do explicit typecasts
     }
 
-    //Cleaup:
+    //Cleanup:
     free(xadj); free(adjncy); free(adjwgt);
     free(perm); free(iperm);
 }

cpp/community_detection_module/grappolo/FullSyncOptimization/parallelLouvainMethodEarlyTerminate.cpp

@@ -181,7 +181,7 @@ double parallelLouvianMethodEarlyTerminate(graph *G, long *C, int nThreads, doub
             //totalUniqueComm += numUniqueClusters;
 
             if((numItrs > 1) && (targetCommAss[i] == pastCommAss[i]) && (targetCommAss[i]==currCommAss[i]) ){
-                verT[i] = true; //Commuity assignment has not changed
+                verT[i] = true; //Community assignment has not changed
                 __sync_fetch_and_add(&termNodes, 1); //Update the number of terminated nodes
             }
 

cpp/community_detection_module/grappolo/FullSyncOptimization/parallelLouvainMethodFullSyncEarly.cpp

@@ -167,7 +167,7 @@ double parallelLouvainMethodFullSyncEarly(graph *G, long *C, int nThreads, doubl
                 //assert((targetCommAss[i] >= 0)&&(targetCommAss[i] < NV));
 
                 if(numItrs > 2 && C[i] == currCommAss[i] && pastCommAss[i]==currCommAss[i]){
-                    //Swaping!!!
+                    //Swapping!!!
                     verT[i] = true;
                     termNodes++;
                 }

cpp/community_detection_module/grappolo/FullSyncOptimization/runMultiPhaseSyncType.cpp

@@ -111,7 +111,7 @@ void runMultiPhaseSyncType(graph *G, mgp_graph *mg_graph, long *C_orig, int sync
         totTimeClustering += tmpTime;
         totItr += tmpItr;
 
-        //Renumber the clusters contiguiously
+        //Renumber the clusters contiguously
         numClusters = renumberClustersContiguously(C, G->numVertices);
 
         //Keep track of clusters in C_orig

cpp/community_detection_module/grappolo/Utility/buildNextPhase.cpp

@@ -94,7 +94,7 @@ double buildNextLevelGraphOpt(graph *Gin, mgp_graph *mg_graph, graph *Gout, long
     }
 #ifdef PRINT_DETAILED_STATS_
 #endif
-    long percentange = 80;
+    long percentage = 80;
     double time1, time2, TotTime=0; //For timing purposes
     double total = 0, totItr = 0;
     //Pointers into the input graph structure:
@@ -271,7 +271,7 @@ void buildNextLevelGraph(graph *Gin, graph *Gout, long *C, long numUniqueCluster
 #endif
     double time1, time2, time3, time4; //For timing purposes
     double total = 0, totItr = 0;
-    long percentange = 80;
+    long percentage = 80;
     //Pointers into the input graph structure:
     long    NV_in        = Gin->numVertices;
     long    NE_in        = Gin->numEdges;
@@ -432,7 +432,7 @@ long buildCommunityBasedOnVoltages(graph *G, long *Volts, long *C, long *Cvolts)
 //Recursive call for finding neighbors
 inline void Visit(long v, long myCommunity, short *Visited, long *Volts,
                   long* vtxPtr, edge* vtxInd, long *C) {
-    long adj1 = vtxPtr[v];   //Begining
+    long adj1 = vtxPtr[v];   //Beginning
     long adj2 = vtxPtr[v+1]; //End
     for(long i=adj1; i<adj2; i++) {
         long w = vtxInd[i].tail;

cpp/community_detection_module/grappolo/Utility/reverseCuthillMcKee.cpp

@@ -97,7 +97,7 @@ void algoReverseCuthillMcKee(graph *G, long *pOrder, int nThreads )
 
 
     //The Queue Data Structure for the Dominating Set:
-    //The Queues are important for synchornizing the concurrency:
+    //The Queues are important for synchronizing the concurrency:
     //Have two queues - read from one, write into another
     // at the end, swap the two.
     long *Q    = (long *) malloc (NV * sizeof(long)); assert(Q != 0);
@@ -303,7 +303,7 @@ void algoReverseCuthillMcKeeStrict( graph *G, long *pOrder, int nThreads )
 
 
     //The Queue Data Structure for the Dominating Set:
-    //The Queues are important for synchornizing the concurrency:
+    //The Queues are important for synchronizing the concurrency:
     //Have two queues - read from one, write into another
     // at the end, swap the two.
     long *Q    = (long *) malloc (NV * sizeof(long)); assert(Q != 0);

cpp/community_detection_module/grappolo/Utility/utilityFunctions.cpp

@@ -181,7 +181,7 @@ void displayGraphCharacteristics(graph *G) {
     long    *vtxPtr   = G->edgeListPtrs;
     long    tNV       = NV; //Number of vertices
 
-    if ( (NS == 0)||(NS == NV) ) {  //Nonbiparite graph
+    if ( (NS == 0)||(NS == NV) ) {  //Nonbipartite graph
         for (long i = 0; i < NV; i++) {
             long degree = vtxPtr[i+1] - vtxPtr[i];
             sum_sq += degree*degree;
@@ -202,7 +202,7 @@ void displayGraphCharacteristics(graph *G) {
     }//End of nonbipartite graph
     else { //Bipartite graph
 
-        //Compute characterisitcs from S side:
+        //Compute characteristics from S side:
         for (long i = 0; i < NS; i++) {
             long degree = vtxPtr[i+1] - vtxPtr[i];
             sum_sq += degree*degree;
@@ -224,7 +224,7 @@ void displayGraphCharacteristics(graph *G) {
         sum_sq = 0;
         maxDegree = 0;
         isolated  = 0;
-        //Compute characterisitcs from T side:
+        //Compute characteristics from T side:
         for (long i = NS; i < NV; i++) {
             long degree = vtxPtr[i+1] - vtxPtr[i];
             sum_sq += degree*degree;

cpp/community_detection_module/grappolo/Utility/utilitySparsificationFunctions.cpp

@@ -202,7 +202,7 @@ double* computeEdgeSimilarityMetrics(graph *G) {
             }//End of while(c1,c2)
             //Now compute the similarity score:
             double similarity = 0;
-            if (setUnion > 0) //Avoind division by zero
+            if (setUnion > 0) //Avoid division by zero
                 similarity = setIntersect / setUnion;
             simWeights[i] = similarity;
             //Find the position for edge (w --> v)
@@ -257,7 +257,7 @@ graph* buildSparifiedGraph(graph *Gin, double alpha) {
         //Process all the neighbors of v:
         for(long i = adj1+1; i < adj2; i++ ) {
             //Always maintain the least weighted neighbor for each vertex;
-            //... this neigbor will get bounced if there is no space
+            //... this neighbor will get bounced if there is no space
             if(edgesAddedSoFar < numTopEdges) {
                 //Add the current edge to the list of top-k edges:
                 isEdgePresent[i] = true;   //Mark this edge as true