Kosaraju's algorithm

Given the directed graph below:

The condensation of a directed graph $G$, or condensed graph $G$ is a directed acyclic graph in which each node represents a strongly connected component in the original graph $G$. For instance, if nodes $5$, $7$ and $8$ form a strongly connected component in $G$, this component will be represented as a single node $578$ in the condensed graph.

All edges of $G$ that do not belong to a strongly connected component remain unchanged in the condensed graph. For example, if the graph $G$ contains two strongly connected components and a directed edge from the first component (comprising of nodes nodes $1$, $2$, and $3$) to the second (comprising of nodes $4$, $5$, $6$, and $7$), then the condensed graph will have two nodes $123$ and $4567$, with a directed edge from $123$ to $4567$. If two strongly connected components in a graph $G$ are connected by more than one edge, the resulting condensed graph will still have only one edge between the corresponding nodes.

Use Kosaraju's algorithm to identify the strongly connected components in the graph and construct its condensation. The expected output format is the following:

13 59
59 78

In the provided format, each line corresponds to an edge in the condensed graph. The digits represent the nodes within a strongly connected component, and these node labels are sorted in an ascending order.