Binary Tree Graph (btree_graph)
This library is a minimal implementation of a graph
(abstract data structure) by way of two binary tree maps
(BTreeMap
). This implementation is often referred to as
an adjacency list.
The primary goals of this implementation are to be
minimal and idiomatic to the Rust language. The alloc
crate is the only dependency when compiled with default
features. As one might assume, alloc
is required for
reason the implementation relies on BTreeMap
(and the
BTreeSet
wrapper).
Secondary concerns include serialization,
deserialization, and encoding. For these the serde
,
serde_json
, serde_yaml
, and serde_cbor
crates
are included and available under the feature flags:
serde
, json
, yaml
, and cbor
. Please see the
encoding module's API for
the optional trait definitions. Note: using json
,
yaml
, or cbor
features will automatically require
a serde
dependency.
Example
use BTreeGraph;
Usage
Add the following to your Cargo.toml
file:
[]
= "0.1.2"
API
Please see the API for a full list of available methods.
License
This work is dually licensed under MIT OR Apache-2.0.