1 / 3

CSC 252: Algorithms

CSC 252: Algorithms. Homework 6 Hao Xi 252a-ak. Step 1: DFS traversal of the digraph with vertices labeled in postfix DFS order.

castor-carney
Télécharger la présentation

CSC 252: Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSC 252: Algorithms Homework 6 Hao Xi252a-ak

  2. Step 1: DFS traversal of the digraph with vertices labeled in postfix DFS order Note: The number after the colon is postfix DFS order. Heavy solid lines are tree edges. Thin solid lines are forward edges. Green dotted lines are cross edges. Blue dashed lines are backward edges.

  3. Step 2-4: Perform DFS on reversed diagraph starting from the highest labeled vertex. If not all vertices are visited, resume DFS from the highest labeled unvisited vertex till all are visited. In the resulting forest, each tree contains the vertices of a strongly connected components.

More Related