【Aizu - ALDS1_7_A】Rooted Trees(树的表达)
摘要:
Rooted Trees Descriptions: A graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a 阅读全文
posted @ 2019-06-23 22:03 Sky丨Star 阅读(403) 评论(0) 推荐(0) 编辑