Module directory_graph 

Produces a graph of Directory,

Use DirectoryGraphBuilder with the chosen insertion order, call DirectoryGraphBuilder::try_insert to insert a Node. Once the whole closure has been inserted, DirectoryGraphBuilder::build can be called to return a DirectoryGraph.

This DirectoryGraph can then be drained in Root-To-Leaves or Leaves-To-Root order.

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

Constructs a DirectoryGraph with a chosen insertion order.

Enums

DrainOrder 🔒

Traits

DirectoryServiceGraphExt

Extension trait to get a DirectoryGraph from a DirectoryService, and insert into it.