1．要求对于给定的图分别用邻接矩阵和邻接表来存储。 2．对于存储好的图进行深度和广度优先遍历。 3．完成图的各种操作。 - 1. Requirements for a given graph adjacency matrix and adjacency were used to store the table. 2. Good depth chart for storage and breadth-first traversal. 3. Complete dia