Determines the strongly connected components of a given graph.
Remarks
A graph is called strongly connected if there exists a directed path between each pair of nodes.
The strongly connected components of a graph are the strongly connected subgraphs of which it consists.
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
- BiconnectedComponents – Determines components defined by the existence of at least two separate undirected paths between all 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 strongly connected components algorithm
const algorithm = new StronglyConnectedComponents()
// run the algorithm
const result = algorithm.run(graph)
// highlight the nodes of the connected components with different styles
for (const node of graph.nodes) {
const componentId = result.nodeComponentIds.get(node)!
graph.setStyle(node, 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 strongly connected components algorithm
const algorithm = new StronglyConnectedComponents({
// 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 nodes of the connected components with different styles
for (const node of graph.nodes) {
const componentId = result.nodeComponentIds.get(node)!
graph.setStyle(node, 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 strongly connected components algorithm
const algorithm = new StronglyConnectedComponents({
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 nodes of the connected components with different styles
for (const node of graph.nodes) {
const componentId = result.nodeComponentIds.get(node)!
graph.setStyle(node, componentStyles.get(componentId)!)
}Methods
Determines the strongly connected components of a given 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
- ↪StronglyConnectedComponentsResult
- A StronglyConnectedComponentsResult containing the strongly connected components 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.