# Experimental Algorithms:
* LAGraph_AllKTruss: all k-trusses of a graph
* LAGraph_BF_basic: conventional Bellman-Ford single source shortest paths
* LAGraph_BF_basic_pushpull: direction optimizing Bellman-Ford single source shortest paths
* LAGraph_BF_full: Bellman-Ford single source shortest paths, with tree
* LAGraph_BF_full1a
* LAGraph_BF_full1
* LAGraph_BF_full2
* LAGraph_BF_basic_mxv
* LAGraph_BF_full_mxv
* LAGraph_BF_pure_c: An implementation in C not using GraphBLAS
* LAGraph_BF_pure_c_double: An implementation in C not using GraphBLAS (uses double type)
* LAGraph_cc_lacc: connected components using the [LACC algorithm](https://people.eecs.berkeley.edu/~aydin/LACC.pdf)
* LAGraph_cdlp: community detection using label propagation
* LAGraph_cdlp_withsort: cdlp variant
* LAGraph_dnn: sparse deep neural network
* LAGraph_KTruss: k-truss of a graph
* LAGraph_lcc: Local clustering coefficient
* LAGraph_msf: Minimum spanning forest
* LAGraph_scc: Strongly connected components
* LAGraph_AllKCore: all K-cores of a graph
* LAGraph_KCore: a single K-core of a graph
* LAGraph_KCoreDecompose:
* LAGraph_MaximalMatching
* LAGraph_Coarsen_Matching
* LAGraph_ExactDiameter
* LAGraph_EstimateDiameter
* LAGraph_MultiSourceBFS
* LAGraph_FastGraphletTransform
* LAGraph_Hdip_Fiedler
* LAGraph_HelloWorld
* LAGraph_HITS
* LAGraph_MaximalIndependentSet
* LAGraph_SquareClustering
* LAGraph_VertexCentrality_Triangle
* LAGr_PageRankGX: PageRank algorithm as defined by LDBC Graphalytics
* LAGr_MarkovClustering
* LAGr_Modularity
* LAGr_PartitionQuality
* LAGr_PeerPressureClustering
* LAGr_TriangleCount_GPU
* LAGraph_argminmax: argmin/argmax of a matrix
* LAGraph_CFL_reachability: Context-Free Language Reachability
* LAGraph_RegularPathQuery: regular path query
* LAGraph_coloring_independent_set
* LAGraph_coloring_MIS
* LAGr_BreadthFirstSearch_Extended: BFS with max_level and destination node options
* LAGr_EdgeBetweennessCentrality
* LAGr_MaximumMatching: maximum bipartite matching