Module algorithms 

Graph algorithms

This module provides various algorithms for graph analysis and manipulation. The algorithms are organized into submodules by category:

• traversal: BFS, DFS, and other traversal algorithms
• shortest_path: Dijkstra, A*, Floyd-Warshall, etc.
• connectivity: Connected components, articulation points, bridges
• flow: Network flow and cut algorithms
• matching: Bipartite matching algorithms
• coloring: Graph coloring algorithms
• paths: Eulerian and Hamiltonian path algorithms
• community: Community detection algorithms
• decomposition: Graph decomposition algorithms
• isomorphism: Graph isomorphism and subgraph matching
• motifs: Motif finding algorithms
• random_walk: Random walk and PageRank algorithms
• similarity: Node and graph similarity measures
• properties: Graph properties like diameter, radius, center

Re-exports

pub use community::fluid_communities_result;

pub use community::greedy_modularity_optimization_result;

pub use community::hierarchical_communities_result;

pub use community::infomap_communities;

pub use community::label_propagation_result;

pub use community::louvain_communities_result;

pub use community::modularity;

pub use community::modularity;

pub use community::modularity_optimization_result;

pub use community::CommunityResult;

pub use community::CommunityStructure;

pub use community::InfomapResult;

pub use community::louvain_communities;Deprecated

pub use community::label_propagation;

pub use community::label_propagation;Deprecated

pub use community::fluid_communities;Deprecated

pub use community::hierarchical_communities;Deprecated

pub use community::modularity_optimization;Deprecated

pub use community::greedy_modularity_optimization;Deprecated

pub use community::parallel_louvain_communities;Deprecated

pub use flow::dinic_max_flow;

pub use flow::minimum_cut;

pub use flow::push_relabel_max_flow;

pub use coloring::*;

pub use connectivity::*;

pub use decomposition::*;

pub use hypergraph::*;

pub use isomorphism::*;

pub use matching::*;

pub use motifs::*;

pub use paths::*;

pub use properties::*;

pub use random_walk::*;

pub use shortest_path::*;

pub use similarity::*;

pub use transformations::*;

pub use traversal::*;

Modules

coloring

Graph coloring algorithms

community

Community detection algorithms

connectivity

Graph connectivity algorithms

decomposition

Graph decomposition algorithms

flow

Flow algorithms for graph processing

hypergraph

Hypergraph algorithms

isomorphism

Graph isomorphism and subgraph matching algorithms

matching

Graph matching algorithms

motifs

Graph motif finding algorithms

paths

Path algorithms for graphs

properties

Graph property algorithms

random_walk

Random walk algorithms

shortest_path

Shortest path algorithms

similarity

Graph similarity algorithms

transformations

Graph transformation algorithms

traversal

Graph traversal algorithms

Functions

betweenness_centrality

Betweenness centrality for nodes

closeness_centrality

Closeness centrality for nodes

eigenvector_centrality

Eigenvector centrality

minimum_spanning_tree

Kruskal’s algorithm for finding minimum spanning tree

pagerank

PageRank algorithm for computing node importance

topological_sort

Topological sort for directed acyclic graphs