Topological sorting - Wikipedia

"Dependency resolution" redirects here. For other uses, see Dependency (disambiguation). In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge (u,v) from vertex u to vertex v, u comes before v in the ordering. For instance, the vertices of the graph may represent tasks to be performed, and the edge

[issyurn]

A dependency solving approach

[mooz]

DAG のソートを行うアルゴリズム. 自分のエッジの行き先ノード全てが, 時分より後に来るよう並べる. require 関係を考慮したパッケージのロードなどに.