RCC, FastAssign, and SwapEdges

[GomezGab]

LAGraph_RichClubCoefficient.c, rcc_demo.c, test_RichClubCoefficient.c, and LG_check_RCC.c

• Get the rich club coefficient of a graph.
• Given a Symmetric Graph with no self-edges, LAGraph_RichClubCoefficient will calculate the rich club coefficients of the graph.
• The values will be output as a sparse GrB_Vector, and the rich club coefficient of k will be found at the closest entry at or above k.
• check_RCC is the pure C version of the algorithm

LAGraph_FastAssign.c and FastAssign_demo.c

• A GBv10 algorithm
• Essentially moves CSC trick found in FastSV7 and in SwapEdges (WIP) to its own function.
• This method is used for cases where you want to build a vector equivalent to the following for loop:

  for (j = 0 ; j < n ; j++)
    {
        uint64_t i = I_vec [j] ;
        c [i] += X_vec [j] ;
    }
  

• Where += is defined by the accum and dup operators.
• See more details in function comments.

LG_CC_FastSV7_FA.c, cc_demo.c, and test_ConnectedComponents.c

• Demonstrates a use case for FastAssign by using FastAssign in the FastSV7 algorithm for GraphBLASv10.
• Passes LG_BRUTAL tests
• Code is simpler but performs as well as FastSV7. (In fact, it is consistently ~5% faster on GAP-twitter in my testing)
• Piggybacked off of cc_demo.c and test_ConnectedComponents.c for testing and benchmarking.

LG_CC_FastSV7.c and LAGraph.h

• Moved out the definition for USING_GRAPHBLAS_V10

LAGraph_SwapEdges.c, test_SwapEdges.c, and SwapEdges_demo.c

• Randomizes undirected, unweighted Graphs.
• Working, but the API will be changed.