摘要: Graph There are two standard ways to represent a graph G=(V,E)G=(V,E), where VV is a set of vertices and EE is a set of edges; Adjacency list represen 阅读全文
posted @ 2019-04-30 16:26 青衫客36 阅读(165) 评论(0) 推荐(0) 编辑
摘要: Rooted Trees A graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on Vrepresented by a set of edges. 阅读全文
posted @ 2019-04-30 16:09 青衫客36 阅读(737) 评论(0) 推荐(0) 编辑