1）　　使用邻接矩阵和邻接表储表示分别实现如下给定的图1、图2、图3所示图的物理存储结构。

2）　　在1）所建立的图形存储结构上分别实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。

-1) Use an adjacency matrix and adjacency table represent savings realized as 1, 2, given the physical storage structure diagram shown in Figure 3. Fig. 2) In a pattern storage structures) were established to achieve a depth-first search traversal and breadth-first search traversal, given through the results (sequence).