Method dfs

KosarajuAlgo.java:3–11

(int node, boolean []vis, ArrayList<ArrayList<Integer>> adj, Stack<Integer> st)

class Solution
{
    private void dfs(int node, boolean []vis, ArrayList<ArrayList<Integer>> adj, Stack<Integer> st) {
        vis[node] = true;
        for (Integer it : adj.get(node)) {
            if (!vis[it]) {
                dfs(it, vis, adj, st);
            }
        }
        st.push(node);
    }
    private void dfsCount(int node, boolean[] vis, ArrayList<ArrayList<Integer>> adjT) {
        vis[node] = true;
        for (Integer it : adjT.get(node)) {