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 convert from one order to the other. 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 (via Self::new_with_insertion_order), different Directory can be passed to Self::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 either order.