Tinygraph

A graph library for Rust.

Tinygraph provides primitives and traversals for working with graphs. It is based on ideas presented in A Minimal Graph API.

Usage

Add this to your Cargo.toml:

toml [dependencies] tinygraph = 0.6.0

Examples

ArrayGraph is a reference Graph implementation. Node, neighbor, and edge iteration order are stable and determined by the from_adjacency function.

```rust use tinygraph::graph::{ Graph, ArrayGraph, Error };

fn main() -> Result<(), Error> { let p3 = ArrayGraph::from_adjacency(vec![ vec![ 1 ], vec![ 0, 2 ], vec![ 1 ] ])?;

assert_eq!(p3.is_empty(), false);
assert_eq!(p3.order());
assert_eq!(p3.size(), 2);
assert_eq!(c3.nodes().to_vec(), vec![ 0, 1, 2 ]);
assert_eq!(c3.neighbors(1)?.to_vec(), vec![ 0, 2 ]);
assert_eq!(c3.has_node(4), false);
assert_eq!(c3.degree(0), 1);
assert_eq!(c3.edges(), vec![
    (0, 1),
    (1, 2)
]);
assert_eq!(c3.has_edge(1, 2), true);

let result = ArrayGraph::from_adjacency(vec![
    vec![ 1 ]
]);

assert_eq!(result, Err(Error::MissingNode(1)));
assert!(false);

Ok(())

} ```

Features include:

• depth-first and breadth-first traversal
• connected components
• greedy matching

Versions

Tinygraph is not yet stable, but care is taken to limit breaking changes whenever possible. Patch versions never introduce breaking changes.

License

Tinygraph is distributed under the terms of the MIT License. See LICENSE-MIT and COPYRIGHT for details.