1 / 6

Strongly Connected Components for Directed Graphs

Strongly Connected Components for Directed Graphs. Kelley Louie Credits: graphs by /demo/graphwin/graphwin. Overview. The following algorithm will determine if a directed graph contains strongly connected components: 1. perform depth first search and label vertices in post fix order

mortonk
Download Presentation

Strongly Connected Components for Directed Graphs

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. Strongly Connected Componentsfor Directed Graphs Kelley Louie Credits: graphs by /demo/graphwin/graphwin

  2. Overview • The following algorithm will determine if a directed graph contains strongly connected components: • 1. perform depth first search and label vertices in post fix order • 2. compute reversed directed graph • 3. perform depth first search on reversed graph • 4. components of this forest are strongly connected components

  3. Depth First Search and Post Fix Order • Perform depth first search on the graph black - tree edge blue - cross edge orange - back edge • Label nodes in post fix order • note: start dfs at node 4 then node 9

  4. Reverse Directed Graph • Compute reversed directed graph (copy the graph but reverse the arrows)

  5. Depth First Search on Reversed Graph • Perform depth first search on reversed graph starting as highest post fix order vertex • continue until finished

  6. Strongly Connected Components • Components from the depth first search of the reversed graph compose the strongly connected components of the original graph

More Related