2017年10月25日

连通分量

摘要: Connected Components Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each 阅读全文

posted @ 2017-10-25 21:49 ZefengYao 阅读(964) 评论(0) 推荐(0) 编辑

深度优先搜索

摘要: Depth First Search Depth-first search (DFS) follows the strategy to search ”deeper” in the graph whenever possible. In DFS, edges are recursively expl 阅读全文

posted @ 2017-10-25 20:59 ZefengYao 阅读(390) 评论(0) 推荐(0) 编辑

导航