Walk the dependency graph implied by a collection of linkables, and visit each linkable; prerequisites form a DAG and are visited in DFS order. (Non-prerequisite connected linkables are visited in an arbitrary order.) Topological sort of DAG G is equivilent to the DFS of the graph G' where for every edge (u,v) in G there is an edge (v,u) in the transposed graph G'. This is handy since dependencies in Flex are a transposed DAG (edges point to predecessors, not successors).
@author Roger Gonzalez