18 unstable releases (5 breaking)

✓ Uses Rust 2018 edition

0.6.2 Apr 14, 2020
0.6.1 Feb 18, 2020
0.6.0 Jan 13, 2020
0.5.3 Oct 4, 2019
0.2.3 Mar 27, 2019

#79 in Data structures

Download history 53/week @ 2020-02-08 50/week @ 2020-02-15 103/week @ 2020-02-22 97/week @ 2020-02-29 49/week @ 2020-03-07 71/week @ 2020-03-14 105/week @ 2020-03-21 57/week @ 2020-03-28 72/week @ 2020-04-04 191/week @ 2020-04-11 69/week @ 2020-04-18 115/week @ 2020-04-25 40/week @ 2020-05-02 18/week @ 2020-05-09 16/week @ 2020-05-16 24/week @ 2020-05-23

320 downloads per month
Used in sac-base

MIT license

100KB
1.5K SLoC

Ruby HTML 1.5K SLoC // 0.4% comments Scons 10 SLoC // 0.4% comments

Graphlib

Build Status Discord Badge Latest Version Documentation

Graphlib is a simple and powerful Rust graph library.


This library attempts to provide a generic api for building, mutating and iterating over graphs that is similar to that of other data-structures found in Rust i.e. Vec, HashMap, VecDeque, etc.

Using Graphlib

use graphlib::Graph;

let mut graph: Graph<usize> = Graph::new();

// Add two vertices to the graph
let id1 = graph.add_vertex(1);
let id2 = graph.add_vertex(2);

// Add an edge between the two vertices
graph.add_edge(&id1, &id2);

assert_eq!(*graph.fetch(&id1).unwrap(), 1);
assert_eq!(*graph.fetch(&id2).unwrap(), 2);

// The graph has 2 vertices and one edge at this point
assert_eq!(graph.vertex_count(), 2);
assert_eq!(graph.edge_count(), 1);

// Remove one of the connected vertices
graph.remove(&id1);

assert_eq!(graph.vertex_count(), 1);
assert_eq!(graph.edge_count(), 0);

Using without std

In Cargo.toml:

[dependencies]
graphlib = { version = "*", features = ["no_std"] }

Contributing

We welcome anyone wishing to contribute to Graphlib! Check out the issues section of the repository before starting out.

License

Graphlib is licensed under the MIT license.

Dependencies

~1MB
~15K SLoC