数据结构专题--图的门路(国外英文资料).docVIP

数据结构专题--图的路径(国外英文资料) 7.22 Determine whether there is a path from u to v The basic idea: to search in depth or breadth from u, to find v, you cant find it Int visited [MAXSIZE]; Int exist_path_DFS (ALGraph G, int I, int j) { If (I = = j) return 1 The else { Visited [I] = 1; (p = G.v.) { K = p - adjvex; If (!?) } } } 7.23 Int exist_path_BFS (ALGraph G, int I, int j) {/ / three things, set access to arrays, initialize queues, and start in teams Int visited [MAXSIZE]; InitQueue (Q); The EnQueue (Q, I); While (! QueueEmpty (Q)) { DeQueue (Q, u); / / out the team and visit Visited [u] = 1; (p = G.v.) { K = p - adjvex; If k = = j return 1; If (! } } } 7.27 Determine whether u to v has a simple path of length k Int visited [MAXSIZE]; Int exist_path_len (ALGraph G, int I, int j, int k) { If (I = = = 0) return 1 Else if (k 0) { Visited [I] = 1; (p = G.v.) { L = p - adjvex; If (! Visited [l]) If (exit_path_len (G, l, j, k-1)) return 1; } Visited [I] = 0; / / if not found in the adjacent point of the point, exit the point } / / to access in other paths Return 0; } 7.28 Lets take the simple path of u to v Int path [MAXSIZE], visited [MAXSIZE]; Int Find_All_Path (ALGraph G, int u, int v, int k) { The path [k] = u; Visited [u] = 1; If (u = = v) { Printf ( Found one path! \ n ); (I = 0; path [I]; I + +) printf ( % d); } The else [u].firstarc; p; p; p; p; p; p; p; p; p; p; p; p; p; p; p; p; p; p; p; p = p-, nextarc) { L = p - adjvex; If (!) Find_All_Path (G, l, v, k + 1); } Visited [I] = 0; The path [k] = 0; } 7.29 Im going to take the number of paths that are not in the loop, the length of the length of k Int GetPathNum_Len (ALGraph G, int I, int j, int len) { If (I = = = 0) return 1 Else if (len 0) { Sum = 0; / / indicates the number of paths through this node Visited [I] = 1; (p = G.v.) { L = p - adjvex; If (! Visited [l]) Sum + = GetPathNum_Len (G, l, j, len - 1); } Visited [I] = 0; } Return the sum. } 7.30 Find all the simple loops in the diagram Int visited [MAXSIZE];