rust-igraph 0.0.1-alpha.3

Pure-Rust, high-performance graph & network analysis library — 370+ algorithms, zero unsafe, igraph-compatible
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

//! Minimal import set for common use cases.
//!
//! ```
//! use rust_igraph::prelude::*;
//! ```
//!
//! This re-exports only the essential types and the most frequently used
//! algorithms. For the full API, import directly from the crate root:
//!
//! ```rust,no_run
//! use rust_igraph::{Graph, louvain, pagerank, betweenness};
//! ```

pub use crate::core::error::{IgraphError, IgraphResult};
pub use crate::core::graph::{Graph, VertexId};

// Traversal
pub use crate::algorithms::traversal::bfs::{bfs, bfs_simple, bfs_tree};
pub use crate::algorithms::traversal::dfs::{dfs, dfs_tree};

// Shortest paths
pub use crate::algorithms::paths::dijkstra::{dijkstra_distances, dijkstra_paths};
pub use crate::algorithms::paths::shortest_paths::get_shortest_paths;

// Centrality
pub use crate::algorithms::properties::betweenness::betweenness;
pub use crate::algorithms::properties::closeness::closeness;
pub use crate::algorithms::properties::pagerank::pagerank;

// Community detection
pub use crate::algorithms::community::louvain::louvain;

// Connectivity
pub use crate::algorithms::connectivity::components::connected_components;
pub use crate::algorithms::connectivity::is_connected::{ConnectednessMode, is_connected};

// Properties
pub use crate::algorithms::properties::degree::{DegreeMode, degree_sequence};
pub use crate::algorithms::properties::is_bipartite::{BipartiteResult, is_bipartite};