#graph #simple #graph-node #insert-only

yanked bag

An insert-only graph that was simple to write, and is simple to understand. It has no dependencies.

Uses old Rust 2015

0.1.2 Mar 13, 2018
0.1.2-3 Jan 16, 2020
0.1.1 Mar 13, 2018
0.1.0 Mar 13, 2018

#81 in #graph-node

MIT license

9KB
85 lines

BAG

Crates.io Travis Codecov

Bag is a bi-direction append only graph for Rust. It is simple to understand and use. It is in part a learning project, and in part a useful component of a future project I am planning.


lib.rs:

Bag

bag is a simple, insert only graph. It is simple to understand conceptually, and modify if needed. Data is represented as NodeIDs, which can be used to retrieve pointers to Nodes stored in the GraphStore. These Nodes point to their parents and children by holding their NodeIDs. These Nodes also hold a datatype <T> (the type of the node and graph), which you can use to store your program specific data.

No runtime deps