Method getTrueComponents

src/main/java/pascal/taie/util/graph/SCC.java:58–60

@return the list of the strongly-connected components, but only those that are true components, i.e. components which have more than one element or consists of one node that has itself as a successor

()

     * or consists of one node that has itself as a successor
     */
    public List<List<N>> getTrueComponents() {
        return trueComponentList;
    }

    private void compute(Graph<N> graph) {
        // use iterative (non-recursive) algorithm to avoid stack overflow