I am searching for an algorithm for finding every weakly connected component in a directed graph. I know for an undirected graph you can do this via a dfs but this obviously doenst work for an directed graph. I am saving my graph as an adjacents list. For example:
A -> B
B -> C
D -> X
So A-B-C is a connected component an D-X
I am not searching for an algorithm for finding strongly connected components!!