Algorithm

Sort all the nodes according to their finishing time: Perform a DFS on the original graph to sort the nodes based on their finishing time, and store them in a stack.
Reverse all the edges of the entire graph: Create a new graph where all the edges of the original graph are reversed.
Perform DFS and count the number of different DFS calls to get the number of SCCs: Start DFS traversal on the reversed graph from the node which is on the top of the stack and continue until the stack becomes empty. For each DFS call, increment the counter representing the number of SCCs by 1.

Create a visited array to keep track of visited nodes and a stack to store nodes based on their finishing times during DFS traversal.
Perform a DFS on the original graph to determine the finishing times of nodes. Each node is pushed onto the stack after all its descendants are processed.
Reverse the edges of the original graph to create a transposed graph.
Perform DFS on the transposed graph, starting from the nodes in the order defined by the stack (based on their finishing times from the first DFS).
Count the number of DFS trees formed in this step, which corresponds to the number of strongly connected components (SCCs).
The count of DFS trees from the second pass is the number of strongly connected components in the original graph.