2015年9月1日
[LintCode] Find the Weak Connected Component in the Directed Graph
摘要： Find the number Weak Connected Component in the directed graph. Each node in the graph contains a label and a list of its neighbors. (a connected set ... 阅读全文
posted @ 2015-09-01 19:36 xchangcheng 阅读(188) 评论(0) 推荐(0) 编辑