pub fn run(
tree: &mut AdvancementRegistry,
root_index: usize,
) -> Result<(), PositionError>Expand description
Calculates advancement positions using the Reingold tilford algorithm X represents display depth and Y is determined by the tree layout