Description: 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"
To Search:
File list (Check if you may need any files):
kcsj
....\Debug
....\.....\kcsj.exe
....\.....\kcsj.ilk
....\.....\kcsj.obj
....\.....\kcsj.pch
....\.....\kcsj.pdb
....\.....\vc60.idb
....\.....\vc60.pdb
....\head.h
....\kcsj.c
....\kcsj.dsp
....\kcsj.dsw
....\kcsj.ncb
....\kcsj.opt
....\kcsj.plg
Download