Partitions the set of nodes of the given graph into independent sets.
Remarks
An independent set is a set of nodes in a graph, in which no two nodes are adjacent.
Other Graph Connectivity Algorithms
yFiles for HTML 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
- 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
- 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 independent sets algorithm
const algorithm = new IndependentSets()
// run the algorithm
const result = algorithm.run(graph)
// highlight the nodes of the independent sets with different styles
for (const node of graph.nodes) {
const componentId = result.nodeSetIds.get(node)
graph.setStyle(node, nodeSetStyles.get(componentId))
}// prepare the independent sets algorithm
const algorithm = new IndependentSets()
// run the algorithm
const result = algorithm.run(graph)
// highlight the nodes of the independent sets with different styles
for (const node of graph.nodes) {
const componentId = result.nodeSetIds.get(node)
graph.setStyle(node, nodeSetStyles.get(componentId)!)
}Type Details
- yfiles module
- view-layout-bridge
- yfiles-umd modules
- view-layout-bridge
- Legacy UMD name
- yfiles.analysis.IndependentSets
See Also
Constructors
Creates a new IndependentSets instance.
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 sets 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 sets 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 independent sets algorithm
const algorithm = new IndependentSets({
// Ignore edges without target arrow heads
subgraphEdges: {
excludes: (edge) =>
edge.style instanceof PolylineEdgeStyle &&
edge.style.targetArrow === IArrow.NONE
}
})
// run the algorithm
const result = algorithm.run(graph)
// highlight the nodes of the independent sets with different styles
for (const node of graph.nodes) {
const componentId = result.nodeSetIds.get(node)
graph.setStyle(node, nodeSetStyles.get(componentId))
}// configure the independent sets algorithm
const algorithm = new IndependentSets({
// Ignore edges without target arrow heads
subgraphEdges: {
excludes: (edge: IEdge): boolean =>
edge.style instanceof PolylineEdgeStyle &&
edge.style.targetArrow === IArrow.NONE
}
})
// run the algorithm
const result = algorithm.run(graph)
// highlight the nodes of the independent sets with different styles
for (const node of graph.nodes) {
const componentId = result.nodeSetIds.get(node)
graph.setStyle(node, nodeSetStyles.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 independent sets algorithm
const algorithm = new IndependentSets({
subgraphNodes: {
// only consider elliptical nodes in the graph
includes: (node) =>
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 independent sets with different styles
for (const node of graph.nodes) {
const componentId = result.nodeSetIds.get(node)
graph.setStyle(node, nodeSetStyles.get(componentId))
}// configure the independent sets algorithm
const algorithm = new IndependentSets({
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 independent sets with different styles
for (const node of graph.nodes) {
const componentId = result.nodeSetIds.get(node)
graph.setStyle(node, nodeSetStyles.get(componentId)!)
}Methods
Partitions the set of nodes of the given graph into independent sets.
Preconditions
- The input graph is
i.e., it contains neither parallel edges nor self-loops.
Parameters
A map of options to pass to the method.
- graph - IGraph
- The input graph to run the algorithm on.
Returns
- ↪IndependentSetsResult
- A IndependentSetsResult containing the independent sets of nodes in
graph.
Throws
- Exception({ name: 'InvalidOperationError' })
- If the algorithm can't create a valid result due to an invalid graph structure or wrongly configured properties.