图的深搜BFS和广搜DFS遍历(国外英语资料).doc

图的深搜BFS和广搜DFS遍历(国外英语资料)*The establishment and traverse of 5- diagram on computer test1) establish the adjacency table storage structure of undirected [unconnected] graphs, requiring that the number of vertices be no less than 15.2) use DFS and BFS to traverse the adjacency table, and print out the traversal order of the two traversal.3) given any two vertices V1, V2, and integer k in the graph, determine whether there is a simple path from V1 to V2 with a path length of K, if you print the vertex sequence on the path of the path (which requires no path on the path).Further: find a simple path from V1 to V2 for all paths of length K. (simple path is the path of a vertex in a vertex sequence that does not contain] [recurrence]* /#includememory#includecstdio#includemalloc.h#define PointNum 15Using namespace std;Struct V{Int vertex;Int distance;Int sign;Struct V* next;}Vertex[PointNum+1];Int P[PointNum];Int union_find (int x) / / and check collection{While (P[x], =x) x=P[x];Return x;}Void DFS (int vertex_);Void BFS (int vertex_);Int DFS (int, V1, int, V2);Int, DFS (int, V1, int, V2, int, V3, int, kn);Int, lujing[PointNum+1], lujing_I;Int, main (){Int, times, vertexNumbers, edgeNumbers, I, J, V1, V2, Distance, kn, n=1, V1, v2;Struct, V, *p, *q, *temp;Printf (enter the number of tests you want to do:);Scanf (%d, times);While (times--){Printf (\n, group%d, data entered.\n , n++ );Printf (enter the top count:);Scanf (%d, vertexNumbers); / / vertexNumbers to ensure that = PointNumFor (I = 0; I vertexNumbers; I + +){Vertex[i].vertex = I; //////////////////////////Vertex[i].distance = 0; ////////////////////////Vertex[i].sign = 0;Vertex[i].next = NULL;}Printf (enter the number of sides:);Scanf (%d, edgeNumbers); / / vertexNumbers to ensure that = PointNumFor (I = 0; I edgeNumbers; I + +){Printf (enter data:);Scanf (%d%d%d, V1, V2, Distance);P = Vertex[V1]; q = Vertex[V1].next;While (q = = NULL) {P = q;Q = q-next;Q points to the end of the Vertex[V1] -NULL}// adjacency list