2017年7月10日

Strongly connected components

摘要： 拓扑排列可以指明除了循环以外的所有指向，当反过来还有路可以走的话，说明有刚刚没算的循环路线，所以反过来能形成的所有树都是循环 阅读全文

posted @ 2017-07-10 22:13 Wujunde 阅读(286) 评论(0) 推荐(0) 编辑

topological sort

摘要： A topological sortof a dag G is a linear ordering of all its vertices such that if G contains anedge(u,v) then u appears before  in the ordering. (If 阅读全文

posted @ 2017-07-10 21:34 Wujunde 阅读(125) 评论(0) 推荐(0) 编辑

depth first search

摘要： Besides creating a depth-first forest, depth-first search also timestamps each vertex.Each vertex  has two timestamps: the first timestamp :d record 阅读全文

posted @ 2017-07-10 21:16 Wujunde 阅读(312) 评论(0) 推荐(0) 编辑