Determines the biconnected components and articulation points of a given undirected graph.
Remarks
A biconnected component is a subgraph which is connected and non-separable, i.e. after removing one single node the component is still connected. Another way of looking at it is that every pair of nodes in a biconnected component has at least two different paths between them.
In a connected (sub)graph the biconnected components are attached to each other at shared nodes, the so-called articulation points. Articulation points represent nodes that, when removed, cause the whole connected component to break up into multiple connected components.
Other Graph Connectivity Algorithms
@PRODUCT@ supports a number of other analysis algorithms that partition the graph into components, based on various criteria.
- ConnectedComponents – Determines components defined by the existence of an undirected path between nodes
- StronglyConnectedComponents – Determines components defined by the existence of a directed path between nodes
- Bipartition – Divides a graph into two partitions where all edges have their source and target in different partitions
- IndependentSets – Divides a graph into partitions where no nodes are connected within a partition
- KCoreComponents – Calculates the k-cores of an undirected input graph. The k-core of an undirected input graph consists of the subgraph components where each node has at least degree
k.
Examples
// prepare the biconnected components algorithm
const algorithm = new BiconnectedComponents()
// run the algorithm
const result = algorithm.run(graph)
// highlight the edges of the biconnected components with different styles
for (const edge of graph.edges) {
const componentId = result.edgeComponentIds.get(edge)!
graph.setStyle(edge, componentStyles.get(componentId)!)
}Type Details
- yFiles module
- view-layout-bridge
See Also
Constructors
Parameters
A map of options to pass to the method.
- subgraphNodes - ItemCollection<INode>
- The collection of nodes which define a subset of the graph for the algorithms to work on. This option either sets the value directly or recursively sets properties to the instance of the subgraphNodes property on the created object.
- subgraphEdges - ItemCollection<IEdge>
- The collection of edges which define a subset of the graph for the algorithms to work on. This option either sets the value directly or recursively sets properties to the instance of the subgraphEdges property on the created object.
Properties
Gets or sets the collection of edges which define a subset of the graph for the algorithms to work on.
Remarks
If nothing is set, all edges of the graph will be processed.
If only the excludes are set, all edges in the graph except those provided in the excludes are processed.
Note that edges which start or end at nodes which are not in the subgraphNodes are automatically not considered by the algorithm.
ItemCollection<T> instances may be shared among algorithm instances and will be (re-)evaluated upon (re-)execution of the algorithm.
Examples
// configure the biconnected components algorithm
const algorithm = new BiconnectedComponents({
// Ignore edges without target arrow heads
subgraphEdges: {
excludes: (edge: IEdge): boolean =>
edge.style instanceof PolylineEdgeStyle &&
edge.style.targetArrow instanceof Arrow &&
edge.style.targetArrow.type === ArrowType.NONE,
},
})
// run the algorithm
const result = algorithm.run(graph)
// highlight the edges of the biconnected components with different styles
for (const edge of graph.edges) {
const componentId = result.edgeComponentIds.get(edge)!
graph.setStyle(edge, componentStyles.get(componentId)!)
}Gets or sets the collection of nodes which define a subset of the graph for the algorithms to work on.
Remarks
If nothing is set, all nodes of the graph will be processed.
If only the excludes are set, all nodes in the graph except those provided in the excludes are processed.
ItemCollection<T> instances may be shared among algorithm instances and will be (re-)evaluated upon (re-)execution of the algorithm.
Examples
// configure the biconnected components algorithm
const algorithm = new BiconnectedComponents({
subgraphNodes: {
// only consider elliptical nodes in the graph
includes: (node: INode): boolean =>
node.style instanceof ShapeNodeStyle &&
node.style.shape === ShapeNodeShape.ELLIPSE,
// but ignore the first node, regardless of its shape
excludes: graph.nodes.first()!,
},
})
// run the algorithm
const result = algorithm.run(graph)
// highlight the edges of the biconnected components with different styles
for (const edge of graph.edges) {
const componentId = result.edgeComponentIds.get(edge)!
graph.setStyle(edge, componentStyles.get(componentId)!)
}Methods
Determines the biconnected components and articulation points of a given undirected graph.
Complexity
O(|V| + |E|)
Parameters
A map of options to pass to the method.
- graph - IGraph
- The input graph to run the algorithm on.
Returns
- ↪BiconnectedComponentsResult
- A BiconnectedComponentsResult containing the biconnected components and articulation points of
graph.
Throws
- Exception({ name: 'InvalidOperationError' })
- If the algorithm can't create a valid result due to an invalid graph structure or wrongly configured properties.