Package com.jgalgo.alg.connect

Interface BiConnectedComponentsAlgo.IResult

    • Method Detail

      • getVertexBiCcs

        IntSet getVertexBiCcs​(int vertex)
        Get the bi-connected components a vertex is contained in.
        Parameters:
        vertex - a vertex in the graph
        Returns:
        the labels of the bi-connected components containing the vertex
        Throws:
        NoSuchVertexException - if vertex is not a valid vertex identifier in the graph

      • getBiCcEdges

        IntSet getBiCcEdges​(int biccIdx)
        Description copied from interface: BiConnectedComponentsAlgo.Result
        Get the edges contained in a single bi-connected component.

        An edge \((u,v)\) is said to be contained in a bi-connected component \(B\) if both \(u\) and \(v\) are in \(B\).

        Specified by:
        getBiCcEdges in interface BiConnectedComponentsAlgo.Result<Integer,​Integer>
        Parameters:
        biccIdx - an index of a bi-connected component
        Returns:
        all the edges that are contained in the bi-connected component

      • isCutVertex

        boolean isCutVertex​(int vertex)
        Check whether a vertex is a cut-vertex.

        A cut vertex is a vertex whose removal disconnects the graph. In the context of bi-connected components, a cut vertex is also a vertex that belongs to more than one bi-connected component. These vertices are also called articulation points, or separating vertices.

        Parameters:
        vertex - a vertex in the graph
        Returns:
        true if vertex is a cut-vertex, false otherwise

      • isCutVertex

        @Deprecated
default boolean isCutVertex​(Integer vertex)
        Deprecated.
        Please use isCutVertex(int) instead to avoid un/boxing.
        Check whether a vertex is a cut-vertex.

        A cut vertex is a vertex whose removal disconnects the graph. In the context of bi-connected components, a cut vertex is also a vertex that belongs to more than one bi-connected component. These vertices are also called articulation points, or separating vertices.

        Specified by:
        isCutVertex in interface BiConnectedComponentsAlgo.Result<Integer,​Integer>
        Parameters:
        vertex - a vertex in the graph
        Returns:
        true if vertex is a cut-vertex, false otherwise

      • getCutVertices

        IntSet getCutVertices()
        Description copied from interface: BiConnectedComponentsAlgo.Result
        Get all the cut vertices in the graph.

        A cut vertex is a vertex whose removal disconnects the graph. In the context of bi-connected components, a cut vertex is also a vertex that belongs to more than one bi-connected component. These vertices are also called articulation points, or separating vertices.

        Specified by:
        getCutVertices in interface BiConnectedComponentsAlgo.Result<Integer,​Integer>
        Returns:
        all the cut vertices in the graph