数据结构课程设计的，选存储结构,输入含n个顶点（用字符表示顶点）和e 条边的图G； (2)求每个顶点的度,输出结果； (3)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS 顶点序列(提示:使用一个栈实现DFS)； (4)指定任意顶点x为初始顶点,对图G作BFS遍历,输出BFS 顶点序列(提示:使用一个队列实现BFS)； (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及 与之相关连的边,并作DFS遍历(执行操作3)；否则输出信 息“无x”； (6)判断图G是否是连通图，输出信息“YES”/“NO”； -Data structures course, choose the storage structure, input containing n vertices vertex (character) and e edges in the graph G　(2) Find the degree of each vertex, the output results　(3) specify an arbitrary vertex xinitial vertex DFS traversal on the graph G, the output DFS sequence of vertices (hint: use a stack to achieve DFS)　(4) specify an arbitrary vertex x is the initial vertex for BFS traversal of a graph G, the output the BFS vertex sequence (Hint: achieve the BFS uses a queue)　(5) input vertices x, find the graph G: If the vertices containing x, then delete the node connected with the side, and for the DFS traversal (perform operations)　otherwiseoutput "x"　(6) to judge a graph G is a connected graph, output "yES"/"nO"