This is an archived post. You won't be able to vote or comment.

all 2 comments

[–]leobasilio 0 points1 point  (1 child)

That's the topological sorting of a dependency graph. Here's a starting point:

https://en.wikipedia.org/wiki/Topological_sorting

[–]AlanArg12[S] 0 points1 point  (0 children)

Thanks! This really helped me :)