pub fn create_nodes_by_level<'a, T>(
    graph: &'a Graph<T, i32, Directed>,
    node_index: NodeIndex,
    current_level: i32
) -> HashMap<i32, HashSet<&'a T>>where
    T: Hash + Eq,
Expand description

Ergonomic method to create a hashmap that represents nodes by level