cleanup: rename FIXMEs to TODO, and remove some that are now resolved

Author: DrTimothyAldenDavis

experimental/algorithm/LAGr_EdgeBetweennessCentrality.c

@@ -429,7 +429,7 @@ int LAGr_EdgeBetweennessCentrality
                 t3 = LAGraph_WallClockTime() - t3;
                 t3_total += t3;
             #else
-                // FIXME: Approx update using ewise add not implemented
+                // TODO: Approx update using ewise add not implemented
                 // centrality = centrality + Update using eWiseAdd
                 double t3 = LAGraph_WallClockTime();
                 GRB_TRY (GrB_eWiseAdd (*centrality, NULL, NULL, GrB_PLUS_FP64, *centrality, Update, NULL));

experimental/algorithm/LAGr_MarkovClustering.c

@@ -15,7 +15,7 @@
 
 //------------------------------------------------------------------------------
 
-// FIXME: ready to consider for src
+// TODO: ready to consider for src
 
 #define LG_FREE_WORK                                                           \
     {                                                                          \

experimental/algorithm/LAGr_MaximumMatching.c

@@ -80,7 +80,7 @@ void minparent(vertex *z, const vertex *x, const vertex *y)
 "    *z = x->parentC < y->parentC ? *x : *y;                    \n" \
 "}"
 
-// FIXME: revise GraphBLAS so we can tell it that the select2nd operator
+// TODO: revise GraphBLAS so we can tell it that the select2nd operator
 // does not use the 'x' input.
 void select2nd(vertex *z, const bool *x, const vertex *y)
 {

experimental/algorithm/LAGr_Modularity.c

@@ -15,7 +15,7 @@
 
 //------------------------------------------------------------------------------
 
-// FIXME: ready to consider for src
+// TODO: ready to consider for src
 
 // The modularity (Q) of a graph clustering C is defined as (directed case):
 //

experimental/algorithm/LAGr_PartitionQuality.c

@@ -15,8 +15,8 @@
 
 //------------------------------------------------------------------------------
 
-// FIXME: ready to consider for src
-// FIXME: define the input vector c that defines the cluster assignment
+// TODO: ready to consider for src
+// TODO: define the input vector c that defines the cluster assignment
 
 // The coverage of a graph clustering C ( Cov(C) ) is defined as the ratio of
 // intra-cluster edges to the total edges in a graph. The performance of a graph

experimental/algorithm/LAGr_PeerPressureClustering.c

@@ -15,9 +15,8 @@
 
 //------------------------------------------------------------------------------
 
-// FIXME: ready to consider for src
-// FIXME: define the output vector c that defines the cluster assignment
-// FIXME: some unused variables (the vector c)
+// TODO: ready to consider for src
+// TODO: define the output vector c_f that defines the cluster assignment
 
 #define LG_FREE_WORK                                                           \
     {                                                                          \
@@ -36,7 +35,6 @@
         GrB_free(&E);                                                          \
         GrB_free(&I);                                                          \
         GrB_free(&ones);                                                       \
-        GrB_free(&c);                                                          \
         LAGraph_Free((void **)&m_index_values, NULL);                          \
         LAGraph_Free((void **)&CfI, NULL);                                     \
         LAGraph_Free((void **)&CfJ, NULL);                                     \
@@ -90,7 +88,6 @@ int LAGr_PeerPressureClustering(
 
     GrB_Index *m_index_values = NULL;
     GrB_Index *CfI = NULL, *CfJ = NULL;
-    GrB_Vector c = NULL;
 
     //--------------------------------------------------------------------------
     // check inputs

experimental/algorithm/LAGr_TriangleCount_GPU.c

@@ -15,7 +15,7 @@
 
 //------------------------------------------------------------------------------
 
-// FIXME: this is a rough test of the GraphBLAS GPU methods for triangle
+// TODO: this is a rough test of the GraphBLAS GPU methods for triangle
 // counting. It will not appear as a user-callable algorithm.
 
 // Count the number of triangles in a graph,

experimental/algorithm/LAGraph_AllKCore.c

@@ -35,8 +35,8 @@
 
 #include "LG_internal.h"
 
-// FIXME: need both basic and expert methods; this is mixed
-// FIXME: match filename to function name (this name is OK)
+// TODO: need both basic and expert methods; this is mixed
+// TODO: match filename to function name (this name is OK)
 // vanilla OK: no GxB used here
 
 int LAGraph_KCore_All
@@ -75,7 +75,7 @@ int LAGraph_KCore_All
         LG_ASSERT_MSG (false, -1005, "G->A must be symmetric") ;
     }
 
-    // FIXME: in basic: compute it, this is Advanced:
+    // TODO: in basic: compute it, this is Advanced:
     // no self edges can be present
     LG_ASSERT_MSG (G->nself_edges == 0, -1004, "G->nself_edges must be zero") ;
 
@@ -84,7 +84,7 @@ int LAGraph_KCore_All
     GrB_Index n, todo, nvals, maxDeg ;
     GRB_TRY (GrB_Matrix_nrows(&n, A)) ;
 
-    // FIXME: do not call Cached in an advanced algorithm, this is Basic:
+    // TODO: do not call Cached in an advanced algorithm, this is Basic:
     //create deg vector using out_degree property
     LG_TRY (LAGraph_Cached_OutDegree(G, msg)) ;
 
@@ -106,7 +106,7 @@ int LAGraph_KCore_All
     //change deg vector to int32 if needed
     if (int_type == GrB_INT32)
     {
-        // FIXME: deg is freed; it should never have been constructed above
+        // TODO: deg is freed; it should never have been constructed above
         GrB_free (&deg) ;
         GRB_TRY (GrB_Vector_new(&deg, int_type, n)) ;
         GRB_TRY (GrB_assign (deg, G->out_degree, NULL, G->out_degree, GrB_ALL, n, NULL)) ;

experimental/algorithm/LAGraph_AllKTruss.c

@@ -52,7 +52,7 @@
 // todo: consider LAGraph_KTrussNext to compute the (k+1)-truss from the
 // k-truss
 
-// FIXME: ready for src
+// TODO: ready for src
 
 #define LG_FREE_ALL                         \
 {                                           \

experimental/algorithm/LAGraph_Coarsen_Matching.c

@@ -9,7 +9,7 @@
 
 //------------------------------------------------------------------------------
 
-// FIXME: ready for src? need a vanilla non-GxB, and incidence graphs.
+// TODO: ready for src? need a vanilla non-GxB, and incidence graphs.
 
 /*
 This method is used to coarsen an undirected graph. The coarsening is based on a maximal matching,