algograph 0.4.0

A (both directed and undirected) graph and their algorithms implemented in Rust
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

//! Traits and implementations for directed and undirected graphs and useful graph wrappers.
//!
//! # Low-level graphs and `TaggedGraph`
//!
//! Some graph libraries allow customized types of vertices and edges.
//! But for algorithm authors, these customized types are hard to deal with.
//! Can we copy a vertex?
//! What is the cost of doing that copying?
//!
//! In this crate, there are traits and implementations of low level graphs.
//! Vertices and edges in low level graphs are lightweight ID's.
//! They are essentially `usize`.
//! Algorithm authors may feel free to copy and store these ID's.
//!
//! There is also `TaggedGraph` to let vertices and edges be tagged.
//! Users may usually experience `TaggedGraph` as easy as those with customized vertice types and edge types in other crates.
//!
//! # Graph wrappers
//!
//! ## `ShadowedSubgraph` and `SelectedSubgraph`
//!
//! They can form subgraphs with shadowed/selected vertices and edges.
//! Futhermore, these subgraphs are shrinkable.
//! While they are shrinking, their underlying graphs are kept unchanged.
//!
//! ## `MappedGraph`
//!
//! It wraps a graph and how its vertices and edges are mapped from another graph.

mod vertex;
pub use self::vertex::*;
mod edge;
pub use self::edge::*;
mod r#trait;
pub use self::r#trait::*;
mod mapped_graph;
pub use self::mapped_graph::*;
mod shadowed_subgraph;
pub use self::shadowed_subgraph::*;
mod selected_subgraph;
pub use self::selected_subgraph::*;
mod graph_debug;

pub mod directed;
pub mod undirected;