rust-igraph 0.7.0

Pure-Rust, high-performance graph & network analysis library — 1297 APIs, 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76

//! 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::attributes::AttributeValue;
pub use crate::core::builder::GraphBuilder;
pub use crate::core::error::{IgraphError, IgraphResult};
pub use crate::core::graph::{EdgeIter, Graph, NeighborsIter, 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::radii::{diameter, eccentricity, radius};
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::eigenvector::eigenvector_centrality;
pub use crate::algorithms::properties::harmonic::harmonic_centrality;
pub use crate::algorithms::properties::hits::{HitsScores, hub_and_authority_scores};
pub use crate::algorithms::properties::katz_centrality::katz_centrality;
pub use crate::algorithms::properties::pagerank::pagerank;

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

// Connectivity
pub use crate::algorithms::connectivity::articulation::articulation_points;
pub use crate::algorithms::connectivity::bridges::bridges;
pub use crate::algorithms::connectivity::components::connected_components;
pub use crate::algorithms::connectivity::is_connected::{ConnectednessMode, is_connected};
pub use crate::algorithms::connectivity::strong::strongly_connected_components;

// Properties
pub use crate::algorithms::properties::basic::{density, mean_distance};
pub use crate::algorithms::properties::coreness::coreness;
pub use crate::algorithms::properties::degree::{DegreeMode, degree_sequence};
pub use crate::algorithms::properties::is_bipartite::{BipartiteResult, is_bipartite};
pub use crate::algorithms::properties::is_simple::is_simple;
pub use crate::algorithms::properties::list_triangles::list_triangles;
pub use crate::algorithms::properties::summary::{GraphSummary, graph_summary};
pub use crate::algorithms::properties::topological_sorting::topological_sorting;
pub use crate::algorithms::properties::triangles::{count_triangles, transitivity_undirected};

// Cliques
pub use crate::algorithms::cliques::clique_number;

// Flow
pub use crate::algorithms::flow::max_flow::max_flow;
pub use crate::algorithms::spanning::mst::{MstAlgorithm, minimum_spanning_tree};

// Isomorphism
pub use crate::algorithms::isomorphism::vf2::isomorphic_vf2;

// Generators
pub use crate::algorithms::constructors::famous::famous;
pub use crate::algorithms::constructors::full::full_graph;
pub use crate::algorithms::constructors::ring::cycle_graph;
pub use crate::algorithms::games::barabasi::barabasi_game_bag;
pub use crate::algorithms::games::erdos_renyi::erdos_renyi_gnp;
pub use crate::algorithms::games::watts::watts_strogatz_game;