Re: Dependency tree resolver in Lua?

[Luiz Henrique de Figueiredo <lhf@...>]

> The code is trivial: construct a directed graph of dependencies, where
> each node has edges pointing at the nodes it depends on. Now search the
> graph for a node with no parents. Remove the node (while building,
> logging, outputting it, or whatever). Repeat until there are no nodes
> left. For extra credit check the graph for cycles first.

Aka topological sorting:
	http://en.wikipedia.org/wiki/Topological_sorting