Topological Sort. • Given a DAG, directed acylic graph. • Find an ordering of the vertices such that is (v, w) ∈ E then v is before w in the ordering.
確定! 回上一頁