构造一个有向图或无向图，选用一种存储结构，分别输出其深度优先和广度优先的结果。

先按自己的意图画出一个顶点不少于8个、边不少于6条的有向图或无向图，用邻接矩阵或邻接表的存储结构，输入图的顶点信息和边的信息，然后调用深度优先和广度优先搜索算法，看结果是否正确。

-Construct a directed graph or undirected graph, choose a storage structure, respectively, the output of its depth-first and breadth-first results. To their own intention to draw a point of not less than eight, edge not less than six of the directed graph or undirected graph with adjacency matrix or adjacency list of the storage structure, type map information and the edge of vertex information, and then call the depth-first and breadth first search algorithm to see the results are correct.