摘要:
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 阅读全文
摘要:
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. 阅读全文
摘要:
A priority queue is a data structure which maintains a set SS of elements, each of with an associated value (key), and supports the following operatio 阅读全文
摘要:
Search III Your task is to write a program of a simple dictionary which implements the following instructions: insert str: insert a string str in to t 阅读全文