scirs2_graph::layout

Function hierarchical_layout

Source 
pub fn hierarchical_layout<N, E, Ix>(
    graph: &DiGraph<N, E, Ix>,
    layer_height: f64,
    node_spacing: f64,
) -> Result<HashMap<N, Position>>
where
    N: Node + Clone + Hash + Eq,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Compute a hierarchical layout for a directed acyclic graph

Nodes are arranged in layers based on their topological ordering.