16-UndirectG.ppt

DFS Search on Undirected Graphs Algorithm : Design Analysis [16] In the last class… Directed Acyclic Graph Topological Order Critical Path Analysis Strongly Connected Component Strong Component and Condensation Leader of Strong Component The Algorihtm DFS Search on Undirected Graph Undirected and Symmetric Digraph UDF Search Skeleton Biconnected Components Articulation Points and Biconnectedness Biconnected Component Algorithm Analysis of the Algorithm Orientation of edges by DFS For an undirected graph, the depth-first search provides an orientation for each of its edges; they are oriented in the direction in which they are first encountered. Nontree edges in symmetric digraph Cross edge: not existing. Back edge: Back to the direct parent: second encounter Otherwise: first encounter Forward edge: always second encounter Modifications to the DFS Skeleton All the second encounter are bypassed. So, the only substantial modification is for the possible back edges leading to an ancestor, but not direct parent. (related technical processing is needed) DFS Skeleton for Undirected Graph int dfsSweep(IntList[] adjVertices,int n, …) int ans; Allocate color array and initialize to white For each vertex v of G, in some order if (color[v]==white) int vAns=dfs(adjVertices, color, v, -1, …); Process vAns // Continue loop return ans; DFS Skeleton for Undirected Graph int dfs(IntList[] adjVertices, int[] color, int v, int p, …) int w; IntList remAdj; int ans; color[v]=gray; Preorder processing of vertex v remAdj=adjVertices[v]; while (remAdj?nil) w=first(remAdj); if (color[w]==white) Exploratory processing for tree edge vw int wAns=dfs(adjVertices, color, w, v …); Backtrack processing for tree edge vw , using wAns else if (color[w]==gray w?p) Checking for nontree edge vw remAdj=rest(remAdj); Postorder processing