|
| 1 | +Minutes, Sept 10, 2025 |
| 2 | + |
| 3 | + * LAGraph v1.2.1: released |
| 4 | + * "vanilla": agreed that if an algorithm cannot be done (or done easily) |
| 5 | + without GxB extensions in SuiteSparse:GraphBLAS, then it is OK for |
| 6 | + the vanilla method to return GrB_NOT_IMPLEMENTED. |
| 7 | + See notes_for_development/000_README_in_development.txt, repeated |
| 8 | + below. |
| 9 | + |
| 10 | +-------------------------------------------------------------------------------- |
| 11 | + |
| 12 | + consider these methods for src. Minor revisions needed in some of them, |
| 13 | + including API revisions: |
| 14 | + |
| 15 | + LAGr_BreadthFirstSearch_Extended.c: uses LG_: |
| 16 | + LG_BreadthFirstSearch_SSGrB_Extended.c |
| 17 | + LG_BreadthFirstSearch_vanilla_Extended.c |
| 18 | + LAGr_PeerPressureClustering.c |
| 19 | + LAGraph_AllKCore.c: need both basic & adv methods; this is mixed |
| 20 | + LAGraph_AllKTruss.c |
| 21 | + LAGraph_HITS.c |
| 22 | + LAGraph_Hdip_Fiedler.c: needs lots of polish |
| 23 | + LAGraph_KCore.c: need both basic & adv |
| 24 | + LAGraph_KTruss.c |
| 25 | + LAGraph_MaximalIndependentSet.c: rename LAGr_, need a basic method |
| 26 | + LAGraph_SquareClustering.c |
| 27 | + LAGraph_VertexCentrality_Triangle.c |
| 28 | + LAGraph_coloring_MIS.c |
| 29 | + LAGraph_coloring_independent_set.c |
| 30 | + LAGraph_lcc.c |
| 31 | + LAGraph_cdlp.c: use Container methods |
| 32 | + |
| 33 | + these need "vanilla" methods, or do we abandon the need for vanilla |
| 34 | + methods and just require SuiteSparse:GraphBLAS? Note that |
| 35 | + SuiteSparse/GraphBLAS.h has "#ifndef GRAPHBLAS_VANILLA" now, |
| 36 | + so it can be told not to expose and GxB methods in GraphBLAS.h. |
| 37 | + |
| 38 | + LAGr_EdgeBetweennessCentrality.c |
| 39 | + LAGr_MarkovClustering.c (but see latest issue posted) |
| 40 | + LAGr_Modularity.c |
| 41 | + LAGr_PartitionQuality.c |
| 42 | + LAGr_SwapEdges.c |
| 43 | + LAGraph_SwapEdges.c |
| 44 | + LAGraph_CFL_reachability.c |
| 45 | + LAGraph_EstimateDiameter.c |
| 46 | + LAGraph_ExactDiameter.c |
| 47 | + LAGraph_FastGraphletTransform.c |
| 48 | + LAGraph_KCoreDecompose.c |
| 49 | + LAGraph_MultiSourceBFS.c |
| 50 | + LAGraph_RegularPathQuery.c |
| 51 | + LAGraph_RichClubCoefficient.c |
| 52 | + LAGraph_scc.c |
| 53 | + LG_CC_FastSV5.c |
| 54 | + LG_CC_FastSV7_FA.c |
| 55 | + |
| 56 | + suggestion: if LAGRAPH_VANILLA is true, and a method |
| 57 | + requires GxB (and we do not have a "vanilla" algorithm), |
| 58 | + then return GrB_NOT_IMPLEMENTED for the "vanilla" case. |
| 59 | + |
| 60 | + DECIDED: at Sept 10, 2025 meeting: the suggestion was accepted |
| 61 | + |
| 62 | + Algorithms need work: |
| 63 | + |
| 64 | + LAGr_MaxFlow.c (need to provide output R matrix? And flow_matrix is |
| 65 | + expensive to compute; revise) |
| 66 | + LAGraph_argminmax.c |
| 67 | + LAGraph_msf.c |
| 68 | + LAGraph_BF_*.c: need just one variant |
| 69 | + |
| 70 | + need new LAGraph_Graph enums: |
| 71 | + |
| 72 | + LAGraph_MaximalMatching.c: need LAGraph_Graph incidence matrix |
| 73 | + LAGraph_Coarsen_Matching.c: need LAGraph_Graph incidence matrix, |
| 74 | + and vanilla method |
| 75 | + LAGr_MaximumMatching.c: need to switch to Container methods; |
| 76 | + need LAGraph_Graph bipartite graph, and vanilla method |
| 77 | + LAGraph_cc_lacc.c: unsure |
| 78 | + |
| 79 | + do not consider: |
| 80 | + |
| 81 | + LAGr_PageRankGX.c: for LDBC benchmarks only |
| 82 | + LAGr_TriangleCount_GPU.c: for testing draft GPU kernels only |
| 83 | + LAGraph_dnn.c: for an IEEE HPEC Graph Challenge only |
| 84 | + LAGraph_HelloWorld.c: will always be experimental |
| 85 | + LAGraph_cdlp_withsort.c: OK, but slow, see LAGraph_cdlp instead |
| 86 | + |
0 commit comments