使用c语言，利用数据结构思想建立图的邻接表的存储结构，实现无向图的深度优先遍历和广度优先遍历。以用户指定的顶点为起点，分别输出每种遍历下的顶点访问序列。

设图的顶点不超过30个，每个顶点用一个编号表示（如果一个图有N个顶点，则它们的编号分别为1，2，…，N）。通过输入图的全部边输入一个图，每条边是两个顶点编号对，可以对边依附顶点编号的输入顺序作出限制（例如从小到大）。

-Using c language data structure used to establish the adjacency table thought the storage structure, free of the graph depth-first traversal and breadth-first traversal. User-specified vertex as a starting point, the output of each traverse were the culmination of access under the sequence. The vertex set of not more than 30, with a number that each vertex (if a graph has N vertices, then their numbers were 1,2, ..., N). By entering the graph all edges entering a graph, each edge two vertices numbers right, vertices can be numbered on the side of attachment to restrict input sequence (for example, from small to large).