Function smartnoise_validator::utilities::get_traversal

pub fn get_traversal(graph: &HashMap<u32, Component>) -> Result<Vec<u32>>

Given a computation graph, return an ordering of nodes that ensures all dependencies of any node have been visited

The traversal also fails upon detecting cyclic dependencies, and attempts to optimize traversal order to minimize caching of intermediate results.