wolf-graph 0.1.0

Data structures and algorithms for working with graphs with reference or value semantics.
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

//! A general graph data structure library with value semantics.
//!
//! by Wolf McNally

mod details;

pub use details::{
    error::Error,
    data::Data
};

mod ids;
pub use ids::{NodeID, EdgeID};

mod elements;
pub use elements::{Nodes, Edges, Elements};

mod graph;
pub use graph::{Graph, BlankGraph};

mod tree;
pub use tree::{Tree, BlankTree};

mod dag;
pub use dag::{DAG, BlankDAG};

mod compound;
pub use compound::{Compound, BlankCompound, CompoundBase};

mod forest;
pub use forest::{Forest, BlankForest};

mod reversed_graph;
pub use reversed_graph::ReversedGraph;

mod algo;
pub use algo::{
    DFSVisitor,
    DepthFirstSearch,
    TopologicalSort,
    PathExists,
    IsTree
};

mod traits;
pub use traits::{
    VisitableGraph,
    MutableGraph,
    VisitableTree,
    MutableTree,
    VisitableCompound,
    MutableCompound,
    VisitableForest,
    MutableForest,
};

#[macro_use]
mod macros;

pub mod prelude;