void dfs()

in src/sizes/dominator_tree.cpp [33:45]

• 13 lines of code
• 4 McCabe index (conditional complexity)

    void dfs(jlong v, jlong &n, const graph_t &graph, jlongs &semi,
             jlongs &parent, jlongs &vertex, graph_t &pred) {
        semi[v] = n;
        vertex[n] = v;
        n++;
        for (jlong w : graph[v]) {
            if (w != 0 && semi[w] == 0) {
                parent[w] = v;
                dfs(w, n, graph, semi, parent, vertex, pred);
            }
            pred[w].push_back(v);
        }
    }