Module directory_graph

Structs§

DirectoryGraph: This represents a full (and validated) graph of Directory nodes. It can be constructed using DirectoryGraphBuilder, and is normally used to receive in one or the other insertion order, validate, and then drain in Leaves-To-Root order. If you just want to validate an order without keeping the results, RootToLeavesValidator or LeavesToRootValidator can be used.
DirectoryGraphBuilder: This allows constructing a DirectoryGraph. After deciding on the insertion order (Self::new_leaves_to_root or Self::new_root_to_leaves with the expected root digest passed), different Directory can be passed to Self::try_insert. A Self::build consumes the builder, returning a validated DirectoryGraph, or an error. The resulting DirectoryGraph can be used to drain the graph in Leaves-To-Root or Root-To-Leaves order.