A strongly connected component is a subgraph where every node is reachable from every other node. The document discusses an algorithm for finding strongly connected components in a graph by performing a depth-first search on the reversed graph and grouping nodes based on the finishing times of the DFS.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
A strongly connected component is a subgraph where every node is reachable from every other node. The document discusses an algorithm for finding strongly connected components in a graph by performing a depth-first search on the reversed graph and grouping nodes based on the finishing times of the DFS.
A strongly connected component is a subgraph where every node is reachable from every other node. The document discusses an algorithm for finding strongly connected components in a graph by performing a depth-first search on the reversed graph and grouping nodes based on the finishing times of the DFS.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
A strongly connected component is a subgraph where every node is reachable from every other node. The document discusses an algorithm for finding strongly connected components in a graph by performing a depth-first search on the reversed graph and grouping nodes based on the finishing times of the DFS.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
Download as ppt, pdf, or txt
You are on page 1of 5
373 Lecture 10
By Javed Siddique Strongly Connected Components • Finding strongly connected components in a graph. Illustration Illustation Algorithm