rust-igraph 0.0.1-alpha.2

Pure-Rust port of the igraph network analysis library (alpha — Phase 1 complete).
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
77
78
79
80
81
82
83
84
85

//! Graph properties — invariants and metrics. Phase 1 entries:
//! ALGO-PR-001 (`girth`), ALGO-PR-002 (triangles + global/local
//! transitivity), ALGO-PR-003 (density + mean distance), ALGO-PR-004
//! (reciprocity), ALGO-PR-005 (avg nearest-neighbour degree),
//! ALGO-PR-006 (degree assortativity).

// `pub(crate)` instead of `pub` so the inner module names (often
// identical to the function they expose, e.g. `is_simple`,
// `pagerank`) don't collide with the function re-exports in the
// rendered rustdoc — see https://github.com/rust-lang/rust/issues/...
pub(crate) mod assortativity;
pub(crate) mod assortativity_weighted;
pub(crate) mod basic;
pub(crate) mod betweenness;
pub(crate) mod betweenness_weighted;
pub(crate) mod closeness;
pub(crate) mod closeness_weighted;
pub(crate) mod convergence_degree;
pub(crate) mod coreness;
pub(crate) mod edge_betweenness;
pub(crate) mod edge_betweenness_weighted;
pub(crate) mod efficiency;
pub(crate) mod eigenvector;
pub(crate) mod girth;
pub(crate) mod harmonic;
pub(crate) mod harmonic_weighted;
pub(crate) mod hits;
pub(crate) mod is_acyclic;
pub(crate) mod is_complete;
pub(crate) mod is_dag;
pub(crate) mod is_forest;
pub(crate) mod is_simple;
pub(crate) mod is_tree;
pub(crate) mod knn;
pub(crate) mod multiplicity;
pub(crate) mod neighborhood;
pub(crate) mod pagerank;
pub(crate) mod pagerank_weighted;
pub(crate) mod reciprocity;
pub(crate) mod topological_sorting;
pub(crate) mod triangles;

pub use assortativity::{assortativity_degree, assortativity_degree_directed};
pub use assortativity_weighted::{
    assortativity_degree_directed_weighted, assortativity_degree_weighted,
};
pub use basic::{density, mean_distance};
pub use betweenness::betweenness;
pub use betweenness_weighted::betweenness_weighted;
pub use closeness::closeness;
pub use closeness_weighted::closeness_weighted;
pub use convergence_degree::{convergence_degree, convergence_degree_full};
pub use coreness::{CorenessMode, coreness, coreness_with_mode};
pub use edge_betweenness::edge_betweenness;
pub use edge_betweenness_weighted::edge_betweenness_weighted;
pub use efficiency::{average_local_efficiency, global_efficiency, local_efficiency};
pub use eigenvector::{
    EigenvectorMode, EigenvectorScores, eigenvector_centrality, eigenvector_centrality_directed,
    eigenvector_centrality_directed_weighted, eigenvector_centrality_full,
    eigenvector_centrality_weighted,
};
pub use girth::girth;
pub use harmonic::harmonic_centrality;
pub use harmonic_weighted::harmonic_centrality_weighted;
pub use hits::{HitsScores, hub_and_authority_scores};
pub use is_acyclic::is_acyclic;
pub use is_complete::is_complete;
pub use is_dag::is_dag;
pub use is_forest::is_forest;
pub use is_simple::{SimpleMode, is_simple, is_simple_with_mode};
pub use is_tree::is_tree;
pub use knn::avg_nearest_neighbor_degree;
pub use multiplicity::{count_loops, count_multiple, has_loop, has_multiple, is_loop, is_multiple};
pub use neighborhood::{
    NeighborhoodMode, neighborhood, neighborhood_size, neighborhood_size_with_mode,
    neighborhood_with_mode,
};
pub use pagerank::pagerank;
pub use pagerank_weighted::pagerank_weighted;
pub use reciprocity::{ReciprocityMode, reciprocity, reciprocity_with_mode};
pub use topological_sorting::topological_sorting;
pub use triangles::{
    count_adjacent_triangles, count_triangles, transitivity_local_undirected,
    transitivity_undirected,
};