![[Pasted image 20240818142343.png]] - gives you correct order to traverse for directed acyclic graph (aka tree) dependencies - using [[DFS]], you can keep appending leftward of an array each leaf node to get the output order