rs-bush
| Crates.io | rs-bush |
| lib.rs | rs-bush |
| version | 0.1.8 |
| source | src |
| created_at | 2023-10-10 10:11:19.410848 |
| updated_at | 2023-11-10 07:58:19.548567 |
| description | A Rust implementation of the Bush data structure. |
| homepage | |
| repository | https://github.com/nic-obert/rs-bush |
| max_upload_size | |
| id | 998985 |
| size | 29,872 |
Nicholas Obert (nic-obert)
documentation
README
rs-bush
Implementation of the bush data structure in Rust.
The bush data structure is an hybrid of a doubly-linked list and a tree. It allows for fast insertion and removal of elements, as well as creating 2-dimensional graphs.
The bush is basically a doubly-linked list of nodes, each of which can have a child bush. The bush is a tree, but it is not a binary tree. Each node can have any number of children.