This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Assignment #5, CS4/531 Due Date: Monday. Nov. 28, 2011 Total points: 47 You MUST turn in your HW by 2:10pm on Nov 28. After that, I will NOT accept your HW. This rule will be STRICTLY ENFORCED. Please PRINT YOUR LAST NAME, FIRST NAME and UB number on the first page. Write solution of each problem on a separate sheet. Staple them in the order of problem numbers. If your homework solution deviates significantly from these guidelines, TA may deduct up to 20% of the points. Although the due date is on Nov 28, you should try to complete HW5 before Thanks Giving break. This is because HW6 will be assigned before the thanks giving break. 1. (3 points) Find the strongly connected components of the graph G = ( V,E ) in Fig. 1, by using the DFS based algorithm in section 22.5. Your solution should provide the following: Run DFS on G . Indicate the DFS trees constructed by DFS algorithm; indicate the d [ u ] and f [ u ] values for each vertex u V . Draw the graph G T . Label the vertices in the reverse order of f [ u ] values. Run DFS algorithm on G T . Indicate the DFS trees constructed by the DFS algorithm. Indicate the strongly connected components of G . b e f d g a h i c Figure 1: Graph for Strongly Connected Components Problem. 2. (4 pts) Consider the graph in Figure 2. Suppose that G is given by adjacency list represen- tation where, for each vertex v , the neighbors of v in Adj( v ) are in alphabetical order . Run the DFS-based biconnectivity algorithm on G with a as the starting vertex. You should: 1. Run DFS algorithm on G ; indicate the DFS tree constructed; 1 2. Rename the vertices of G by integers in the order they are visited by the DFS algorithm; 3. Compute low( v ) for each vertex...
View Full Document
- Fall '11