graph_builder 0.4.1

A building block for high-performant graph algorithms.
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

pub use crate::builder::GraphBuilder;

pub use crate::graph::csr::CsrLayout;
pub use crate::graph::csr::DirectedCsrGraph;
pub use crate::graph::csr::UndirectedCsrGraph;
pub use crate::graph::Target;

pub use crate::graph::adj_list::DirectedALGraph;
pub use crate::graph::adj_list::UndirectedALGraph;

pub use crate::graph_ops::DegreePartitionOp;
pub use crate::graph_ops::DeserializeGraphOp;
pub use crate::graph_ops::ForEachNodeParallelByPartitionOp;
pub use crate::graph_ops::ForEachNodeParallelOp;
pub use crate::graph_ops::InDegreePartitionOp;
pub use crate::graph_ops::OutDegreePartitionOp;
pub use crate::graph_ops::RelabelByDegreeOp;
pub use crate::graph_ops::SerializeGraphOp;
pub use crate::graph_ops::ToUndirectedOp;

pub use crate::index::Idx;
pub use atomic::Atomic;

pub use crate::input::*;

pub use crate::DirectedDegrees;
pub use crate::DirectedNeighbors;
pub use crate::DirectedNeighborsWithValues;
pub use crate::Graph;
pub use crate::NodeValues;
pub use crate::UndirectedDegrees;
pub use crate::UndirectedNeighbors;
pub use crate::UndirectedNeighborsWithValues;

pub use crate::EdgeMutation;
pub use crate::EdgeMutationWithValues;

pub use crate::Error;