Interface StrongConnectivityAlgorithm<V,​E>

    • Method Detail

      • getGraph

        Graph<V,​E> getGraph()
        Return the underlying graph.
        the underlying graph
      • isStronglyConnected

        boolean isStronglyConnected()
        Returns true if the graph is strongly connected, false otherwise.
        true if the graph is strongly connected, false otherwise
      • stronglyConnectedSets

        java.util.List<java.util.Set<V>> stronglyConnectedSets()
        Computes a List of Sets, where each set contains vertices which together form a strongly connected component within the given graph.
        List of Set s containing the strongly connected components
      • getStronglyConnectedComponents

        java.util.List<Graph<V,​E>> getStronglyConnectedComponents()
        Computes a list of subgraphs of the given graph. Each subgraph will represent a strongly connected component and will contain all vertices of that component. The subgraph will have an edge $(u,v)$ iff $u$ and $v$ are contained in the strongly connected component.
        a list of subgraphs representing the strongly connected components
      • getCondensation

        Graph<Graph<V,​E>,​DefaultEdge> getCondensation()
        Compute the condensation of the given graph. If each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph, the condensation of the graph.
        the condensation of the given graph