Tag DAG

Single-Source Shortest Path:on DAG(directed acyclic graph)

介紹在DAG(directed acyclic graph)上處理Single-Source Shortest Path問題之演算法。

Graph: 利用DFS尋找DAG的Topological Sort(拓撲排序)

利用DFS尋找directed acyclic graph(DAG)的Topological Sort(拓撲排序)。

Graph: 利用DFS尋找Strongly Connected Component(SCC)

利用DFS尋找diredted graph中的strongly connected component(SCC)。


Page 1 / 1