Write pseudocode for 'Strongly Connected Components' algorithm so that it take the inputs >> G(V,E) which is directed graph in adjacency list format and s which is source node, then return list of all nodes that are reachable two ways from s.

Example of 'Strongly Connected Components' algorithm could be found online but it is complicated to understand so please explain your pseudocode and make sure it take my inputs and output I wan please. Thank you!