What are Strongly Connected Components?
- SSCs can be thought of as self-contained cycles within a directed graph where every vertex in a given cycle can reach every other vertex in the same cycle.
- SCCs in a graph are unique.
Tarjan’s SCC Algorithm
Low-Link Values
- The low-link value of a node is the smallest (lowest) node id reachable from that node when doing a DFS (including itself). ###
References
- https://www.youtube.com/watch?v=wUgWX0nc4NY