rust-igraph 0.6.0

Pure-Rust, high-performance graph & network analysis library — 1200+ 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

//! Graph operators (ALGO-OP-*). Phase 1: `simplify` (remove loops and/or
//! parallel edges, returning a new [`crate::Graph`]).

// `pub(crate)` so the inner module names don't double-list with the
// function re-exports in rustdoc.
pub(crate) mod bipartite_projection;
pub(crate) mod bipartite_projection_size;
pub(crate) mod complementer;
pub(crate) mod compose;
pub(crate) mod connect_neighborhood;
pub(crate) mod contract_vertices;
pub(crate) mod difference;
pub(crate) mod disjoint_union;
pub(crate) mod even_tarjan;
pub(crate) mod induced_subgraph;
pub(crate) mod induced_subgraph_edges;
pub(crate) mod intersection;
pub(crate) mod is_same_graph;
pub(crate) mod join;
pub(crate) mod line_graph;
pub(crate) mod permute_vertices;
pub(crate) mod products;
pub(crate) mod residual_graph;
pub(crate) mod reverse;
pub(crate) mod rewire;
#[allow(
    clippy::cast_precision_loss,
    clippy::cast_possible_truncation,
    clippy::cast_sign_loss
)]
pub(crate) mod rewire_edges;
pub(crate) mod simplify;
pub(crate) mod subgraph_from_edges;
pub(crate) mod to_directed;
pub(crate) mod to_undirected;
pub(crate) mod union;

pub use bipartite_projection::{BipartiteProjection, bipartite_projection};
pub use bipartite_projection_size::{BipartiteProjectionSize, bipartite_projection_size};
pub use complementer::complementer;
pub use compose::compose;
pub use connect_neighborhood::{connect_neighborhood, graph_power};
pub use contract_vertices::contract_vertices;
pub use difference::difference;
pub use disjoint_union::{disjoint_union, disjoint_union_many};
pub use even_tarjan::{EvenTarjanResult, even_tarjan_reduction};
pub use induced_subgraph::{InducedSubgraphResult, induced_subgraph};
pub use induced_subgraph_edges::induced_subgraph_edges;
pub use intersection::{intersection, intersection_many};
pub use is_same_graph::is_same_graph;
pub use join::join;
pub use line_graph::line_graph;
pub use permute_vertices::{invert_permutation, permute_vertices};
pub use products::{
    GraphProductType, cartesian_product, graph_product, lexicographic_product, modular_product,
    rooted_product, strong_product, tensor_product,
};
pub use residual_graph::{ResidualGraphResult, residual_graph, reverse_residual_graph};
pub use reverse::{reverse, reverse_edges};
pub use rewire::rewire;
pub use rewire_edges::{RewireDirectedMode, rewire_directed_edges, rewire_edges};
pub use simplify::simplify;
pub use subgraph_from_edges::{SubgraphFromEdgesResult, subgraph_from_edges};
pub use to_directed::{ToDirectedMode, to_directed};
pub use to_undirected::{ToUndirectedMode, to_undirected};
pub use union::{union, union_many};