2017年7月7日

摘要: given a graph G and a distinguished source vertex s, breadth-firstsearch systematically explores the edges of G to “discover” every vertex that isreac 阅读全文

posted @ 2017-07-07 22:04 Wujunde 阅读(182) 评论(0) 推荐(0)

摘要: We can choose between two standard ways to represent a graph as a collection of adjacency lists or as an adjacency matrix. Either way appliesto both d 阅读全文

posted @ 2017-07-07 22:00 Wujunde 阅读(218) 评论(0) 推荐(0)