Interface BiConnectedComponentsAlgo.IResult
- All Superinterfaces:
BiConnectedComponentsAlgo.Result<Integer,Integer>
- Enclosing interface:
BiConnectedComponentsAlgo
BiConnectedComponentsAlgo computation for IntGraph.- Author:
- Barak Ugav
-
Method Summary
Modifier and TypeMethodDescriptiongetBiCcEdges(int biccIdx) Get the edges contained in a single bi-connected component.getBiCcVertices(int biccIdx) Get the vertices contained in a single bi-connected component.Get all the cut vertices in the graph.getVertexBiCcs(int vertex) Get the bi-connected components a vertex is contained in.default IntSetgetVertexBiCcs(Integer vertex) Deprecated.booleanisCutVertex(int vertex) Check whether a vertex is a cut-vertex.default booleanisCutVertex(Integer vertex) Deprecated.Please useisCutVertex(int)instead to avoid un/boxing.Methods inherited from interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo.Result
getBlockGraph, getNumberOfBiCcs
-
Method Details
-
getVertexBiCcs
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- ifvertexis not a valid vertex identifier in the graph
-
getVertexBiCcs
Deprecated.Please usegetVertexBiCcs(int)instead to avoid un/boxing.Get the bi-connected components a vertex is contained in.- Specified by:
getVertexBiCcsin interfaceBiConnectedComponentsAlgo.Result<Integer,Integer> - Parameters:
vertex- a vertex in the graph- Returns:
- the labels of the bi-connected components containing the vertex
-
getBiCcVertices
Description copied from interface:BiConnectedComponentsAlgo.ResultGet the vertices contained in a single bi-connected component.- Specified by:
getBiCcVerticesin interfaceBiConnectedComponentsAlgo.Result<Integer,Integer> - Parameters:
biccIdx- an index of a bi-connected component- Returns:
- all the vertices that are contained in the bi-connected component
-
getBiCcEdges
Description copied from interface:BiConnectedComponentsAlgo.ResultGet 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:
getBiCcEdgesin interfaceBiConnectedComponentsAlgo.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:
trueifvertexis a cut-vertex,falseotherwise
-
isCutVertex
Deprecated.Please useisCutVertex(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:
isCutVertexin interfaceBiConnectedComponentsAlgo.Result<Integer,Integer> - Parameters:
vertex- a vertex in the graph- Returns:
trueifvertexis a cut-vertex,falseotherwise
-
getCutVertices
IntSet getCutVertices()Description copied from interface:BiConnectedComponentsAlgo.ResultGet 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:
getCutVerticesin interfaceBiConnectedComponentsAlgo.Result<Integer,Integer> - Returns:
- all the cut vertices in the graph
-
getVertexBiCcs(int)instead to avoid un/boxing.