Crate sorbus

This crate implements a tree data structure.

A tree is a directed acyclic graph of nodes, all of them carrying an optional payload, as well as an optional annotation to the edge linking them to their parent.

Each node in the tree may contain an arbitratry number of children.

Modules

errors

render

Structs

Node

A node in the tree. A Node can carry a Payload, and annotate the branch to its parent with an Edge.

Tree

Type Aliases

NodeID