题目1：图的建立与遍历；连通网的最小生成树生成实现。

内容：

1）　　用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。

2）　　在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。

3）　　按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。

-Title 1: Map of the establishment and ergodicity　connectivity network to achieve minimum spanning tree generated. Content: 1) that the methods used to establish the adjacent table shown in Figure 1 Figure storage structure, said depositors with adjacency matrix method as shown in Figure 2 network storage structure. 2) In Figure 1 storage structure (adjacency list) to achieve depth-first search traversal and breadth-first search traversal, and gives Ergodic results (sequence). 3) in accordance with the prim algorithm, as shown in Figure 2-connected network storage structure (adjacency matrix) to achieve this network, minimum spanning tree and spanning tree output.