Method init

src/main/java/pascal/taie/util/graph/MergedSCCGraph.java:46–65

(Graph<N> graph)

    }

    private void init(Graph<N> graph) {
        nodes = Sets.newSet();
        // Map from original node to the corresponding merged node.
        Map<N, MergedNode<N>> nodeMap = Maps.newMap(graph.getNumberOfNodes());
        SCC<N> scc = new SCC<>(graph);
        scc.getComponents().forEach(component -> {
            MergedNode<N> node = new MergedNode<>(component);
            component.forEach(n -> nodeMap.put(n, node));
            nodes.add(node);
        });
        nodes.forEach(node -> node.getNodes()
                .stream()
                .flatMap(n -> graph.getSuccsOf(n).stream())
                .map(nodeMap::get)
                .filter(succ -> succ != node) // exclude self-loop
                .forEach(succ -> {
                    node.addSucc(succ);
                    succ.addPred(node);
                }));
    }

    @Override
    public Set<MergedNode<N>> getPredsOf(MergedNode<N> node) {