数据结构上机（Data structure on computer）.doc

数据结构上机（Data structure on computer） [network synthesis - self-study examination questions] Weave a C program, it can be read according to the data to construct a directed graph G, and output G DFS traversal sequence (starting from V0), the form of input n V0, Vi0, Vi2, V1, Vi1, V2...... Vi, Vin, -1, -1 (-1, -1) are the input end tags, and the remaining values are =0 and n0. (Note: the executable name of the program must be e3.exe). #include Typedef, enum, {False, True}, Boolean; Int G[100][100]; Int n; Void (CreatG) / * to establish the adjacency matrix of a graph G[][]*/ {int, I, j; Printf (Input the, number, of, the, node:); Scanf (%d, n); Printf (\n); For (i=0; Ifor (j=0); J G[i][j]=0; Do {scanf (%d%d, i, j); G[i][j]=1; }while ((I! =-1) (J! =-1)); } Void (TopSort) / * * / output topological sorting, topological sequence {int, I, j; Int degree[100]; / * in accordance with precursor vertex priority that degree[] storage nodes in.*/ Boolean, visited[100], flag=True; Printf (The Topolgical Order as follow:); For (i=0; i{degree[i]=0; Visited[i]=False; } Printf (\n); While (flag==True) { For (i=0; Ifor (j=0; jdegree[i]=G[j][i]+degree[i]); I=0; While ((IIF (i{printf) (%d), I); Visited[i]=True; For (j=0; J {G[i][j]=0; degree[j]=0;} } Else flag=False; } } (main) {CreatG (); TopSort (); } 1., a C program, which can be read according to the data to construct a directed graph G, and output G adjacency matrix and DFS traversal sequence (starting from V0), the form of input n Vi0, Vj0, Vj2, Vi1, Vj1, Vi2...... Vim, Vjm, -1, -1 (-1, -1 are input end tags), they are all integers, and 100n0, and the rest of the values are =0, and (Note: the executable name of the program must be e1.exe, stored in your account or in its debug directory) 2. compiling a C program, it can read two sets of integers (each integer to -9999 for the end tag number is not greater than 1000), and in order to output both of all integers in the first set of integers and not in the second group of integers (w