Expand description
Module contains all of the graph-based algorithms within bixverse-rs.
Modulesยง
- community_
detections - Graph community detection algorithms. WalkTrap lives here; Leiden and
Louvain live in
crate::graph::leidenand are re-exported. - graph_
abstraction - Partition-based graph abstraction, the connectivity statistic behind PAGA.
- graph_
clustering - Graph-based clustering algorithms, namely spectral clustering
- graph_
components - Connected components over CSR adjacency matrices.
- graph_
label_ propagations - Label propagation algorithms over kNN graphs specifically (but with extension to other domains)
- graph_
metrics - Metrics related to graphs - for now only conductance for community membership.
- graph_
structures - Structures for graphs within bixverse.
- knn_
graph - kNN graph construction: one
KnnSymmetrisationchoice turns a directed kNN into an undirected weightedSparseGraph. - leiden
- Leiden and Louvain community detection on modularity.
- page_
rank - Implementations of the PageRank algorithm for rapid identification of influential nodes in the network
- shortest_
paths - Shortest-path algorithms over CSR adjacency matrices.
- spanning_
tree - Minimum and maximum spanning forests over CSR adjacencies.