04 2016 档案

algorithm@ Shortest Path in Directed Acyclic Graph (O(|V|+|E|) time)
摘要：Given a Weighted Directed Acyclic Graph and a source vertex in the graph, find the shortest paths from given source to all other vertices. For a gener 阅读全文
posted @ 2016-04-08 11:20 流白 阅读(377) 评论(0) 推荐(0)
algorithm@ Strongly Connected Component
摘要：Strongly Connected Components <!-- .entry-header --> A directed graph is strongly connected if there is a path between all pairs of vertices. A strong 阅读全文
posted @ 2016-04-07 08:23 流白 阅读(613) 评论(0) 推荐(0)