xgraph 3.0.0

Graph algorithms for Rust: shortest paths, centrality, connectivity, spanning trees and community detection, over directed, undirected and heterogeneous multigraphs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

//! Algorithms written once against [`GraphView`](crate::core::GraphView).

pub mod bridges;
pub mod centrality;
#[cfg(feature = "community")]
pub mod community;
pub mod connectivity;
pub mod dominating_set;
pub mod shortest_path;
pub mod spanning_tree;
pub mod topological;
pub mod traversal;

pub use bridges::{Bridges, TarjanState};
pub use centrality::{Centrality, CentralityError};
#[cfg(feature = "community")]
pub use community::{CommunityConfig, CommunityDetection, CommunityDetectionError};
pub use connectivity::{Connectivity, Predecessors};
pub use dominating_set::DominatingSet;
pub use shortest_path::{ShortestPath, ShortestPathError};
pub use spanning_tree::{DisjointSets, SpanningTree};
pub use topological::{TopologicalError, TopologicalSort};
pub use traversal::{Traversal, TraversalError};