# Implementation of Kosaraju's Algorithm

Explore how to implement splitting a graph into its strongly connected components.

## We'll cover the following

## Implementing SCC identification

Our implementation of Kosaraju’s algorithm uses similar building blocks as our topological sort implementation. The setup of the class is similar, again using the adjacency list graph representation.

Get hands-on with 1400+ tech skills courses.