typo: betweeness -> betweenness

Author: DrTimothyAldenDavis

Config/LAGraph.h.in

@@ -2410,11 +2410,11 @@ int LAGr_SingleSourceShortestPath
 ) ;
 
 //------------------------------------------------------------------------------
-// LAGr_Betweenness: betweeness centrality metric
+// LAGr_Betweenness: betweenness centrality metric
 //------------------------------------------------------------------------------
 
-/** LAGr_Betweenness: betweeness centrality metric.  This methods computes an
- * approximation of the betweeness-centrality metric of all nodes in the graph.
+/** LAGr_Betweenness: betweenness centrality metric.  This methods computes an
+ * approximation of the betweenness-centrality metric of all nodes in the graph.
  * Only a few given source nodes are used for the approximation.  This is an
  * Advanced algorithm (G->AT is required).
  *
@@ -2442,7 +2442,7 @@ LAGRAPH_PUBLIC
 int LAGr_Betweenness
 (
     // output:
-    GrB_Vector *centrality,     // centrality(i): betweeness centrality of i
+    GrB_Vector *centrality,     // centrality(i): betweenness centrality of i
     // input:
     const LAGraph_Graph G,      // input graph
     const GrB_Index *sources,   // source vertices to compute shortest paths

experimental/algorithm/LAGr_EdgeBetweennessCentrality.c

@@ -21,7 +21,7 @@
 // FIXED in v10.2 but may need more work in GraphBLAS.
 
 // LAGr_EdgeBetweennessCentrality: Exact algorithm for computing
-// betweeness centrality.
+// betweenness centrality.
 
 // This is an Advanced algorithm (no self edges allowed)
 
@@ -91,7 +91,7 @@ void LG_EBC_add_one_divide_function (double *z, const double *x, const double *y
 int LAGr_EdgeBetweennessCentrality
 (
     // output:
-    GrB_Matrix *centrality,     // centrality(i): betweeness centrality of i
+    GrB_Matrix *centrality,     // centrality(i): betweenness centrality of i
     // input:
     LAGraph_Graph G,            // input graph
     GrB_Vector sources,         // source vertices to compute shortest paths

experimental/test/LG_check_edgeBetweennessCentrality.c

@@ -338,7 +338,7 @@ int LG_check_edgeBetweennessCentrality
     if (print_timings)
     {
         tt = LAGraph_WallClockTime ( ) - tt ;
-        printf ("LG_check_edgeBetweenessCentrality time: %g sec\n", tt) ;
+        printf ("LG_check_edgeBetweennessCentrality time: %g sec\n", tt) ;
         tt = LAGraph_WallClockTime ( ) ;
     }
 

include/LAGraph.h

@@ -2410,11 +2410,11 @@ int LAGr_SingleSourceShortestPath
 ) ;
 
 //------------------------------------------------------------------------------
-// LAGr_Betweenness: betweeness centrality metric
+// LAGr_Betweenness: betweenness centrality metric
 //------------------------------------------------------------------------------
 
-/** LAGr_Betweenness: betweeness centrality metric.  This methods computes an
- * approximation of the betweeness-centrality metric of all nodes in the graph.
+/** LAGr_Betweenness: betweenness centrality metric.  This methods computes an
+ * approximation of the betweenness-centrality metric of all nodes in the graph.
  * Only a few given source nodes are used for the approximation.  This is an
  * Advanced algorithm (G->AT is required).
  *
@@ -2442,7 +2442,7 @@ LAGRAPH_PUBLIC
 int LAGr_Betweenness
 (
     // output:
-    GrB_Vector *centrality,     // centrality(i): betweeness centrality of i
+    GrB_Vector *centrality,     // centrality(i): betweenness centrality of i
     // input:
     const LAGraph_Graph G,      // input graph
     const GrB_Index *sources,   // source vertices to compute shortest paths

include/LAGraphX.h

@@ -1310,7 +1310,7 @@ LAGRAPHX_PUBLIC
 int LAGr_EdgeBetweennessCentrality
 (
     // output:
-    GrB_Matrix *centrality,     // centrality(i): betweeness centrality of i
+    GrB_Matrix *centrality,     // centrality(i): betweenness centrality of i
     // input:
     LAGraph_Graph G,            // input graph
     GrB_Vector sources,         // source vertices to compute shortest paths (if NULL or empty, use all vertices)

src/algorithm/LAGr_Betweenness.c

@@ -17,7 +17,7 @@
 //------------------------------------------------------------------------------
 
 // LAGr_Betweenness: Batch algorithm for computing
-// betweeness centrality, using push-pull optimization.
+// betweenness centrality, using push-pull optimization.
 
 // This is an Advanced algorithm (G->AT is required).
 
@@ -87,7 +87,7 @@
 int LAGr_Betweenness
 (
     // output:
-    GrB_Vector *centrality,     // centrality(i): betweeness centrality of i
+    GrB_Vector *centrality,     // centrality(i): betweenness centrality of i
     // input:
     LAGraph_Graph G,            // input graph
     const GrB_Index *sources,   // source vertices to compute shortest paths

src/test/test_Betweenness.c

@@ -277,7 +277,7 @@ void test_bc (void)
 }
 
 //------------------------------------------------------------------------------
-// test_bc_brutal: test BetweenessCentraliy with brutal malloc debugging
+// test_bc_brutal: test BetweennessCentrality with brutal malloc debugging
 //------------------------------------------------------------------------------
 
 #if LG_BRUTAL_TESTS