pub type Compound<InnerGraph> = CompoundBase<InnerGraph, BlankForest>;Expand description
A compound graph is a graph with a parallel forest that puts the nodes of the graph into a hierarchy.
The sets of edges of the graph and the forest are disjoint. The set of nodes between the graph and the tree are identical.
Aliased Typeยง
pub struct Compound<InnerGraph> { /* private fields */ }