beads

Data structure for representing hierarchies.

   Copyright 2019 Ahmed Charles <acharles@outlook.com>

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.

lib.rs:

A Forest<T> is a data structure used to represent a heirarchy. The heirachy is stored within the container, allowing T to be any type that can be stored in a normal collection.