Function serde_generate::analyzer::best_effort_topological_sort
source · pub fn best_effort_topological_sort<T>(
children: &BTreeMap<T, BTreeSet<T>>
) -> Vec<T>where
T: Clone + Ord + Eq + Hash,
Expand description
Classic topological sorting algorithm except that it doesn’t abort in case of cycles.