深度优先搜索中南大学软件学院研究生.ppt

Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * Decrease and Conquer * * mlogm * mlogm * * Main program: 1. for v=1 to n do v.colour=white; 2. for v=1 to n do if v.colour=white then DFS(v) DFS(v) 1. v.color=gray 2. for each edge[v,w] do if w.color==white then dad[w]=v DFS(w) else if dad[w]≠v stop(‘cycle’) 3. color[v]=black * * Depth-first search: applications Test whether graph G contains a triangle or not * * Depth-first search: directed graphs Depth-first search: directed graphs * * Depth-first search: Notes 图中的边的类型： * * Topological Sorting Problem: Given a Directed Acyclic Graph(DAG) G = (V, E), find a linear ordering of all its vertices such that if G contains an edge u, v, then u appears before v in the ordering. C1 C3 C2 C5 C4 Based on DFS C1 C3 C2 C5 C4 * * Based on DFS DFSvisit(G) { for each vertex u { u.color = WHITE; } Int Colororder[n];i=1; for each vertex u { if (u.color == WHITE) DFS(u); } ourput the vertices in colororder[] in reversing order. } DFS(u) { u.color = gray; for each v ? u.Adj[] { if (v.color = = WHITE) DFS(v); } u.color = black; colororder[i]=u; i++; } * * Topological Sorting C1 C3 C2 C5 C4 * * Source removal algorithm Input: G Output: a topological sorting order of vertices 1. Int tp[n]; j=1; 2. While there exists a vertex u with indegree 0 do tp[j]=u; j++; delete u; decrease the indegrees of the neighbors of u; 3. Return the vertices in tp. * * Depth-first search: directed graphs Give a graph G, find all the strongly connected components in G * * Depth-first search: directed graphs * * Dept