This class provides methods for calculating independent sets.
Remarks
Note: Methods of this class work with instances of Graph. To partition an IGraph into independent sets use IndependentSets instead.
An independent set is a set of nodes in a graph, in which no two nodes are adjacent.
Type Details
- yfiles module
- algorithms
- yfiles-umd modules
- All layout modules, view-layout-bridge
- Legacy UMD name
- yfiles.algorithms.IndependentSets
Static Methods
Calculates an independent set for a given graph.
Remarks
Note: This method works with instances of Graph. To partition an IGraph into independent sets use IndependentSets instead.
A greedy heuristic is applied which tries to find a large independent set.
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.
- conflictGraph - Graph
- the input graph
Returns
See Also
Partitions the set of nodes of the given graph into independent sets.
Remarks
Note: This method works with instances of Graph. To partition an IGraph into independent sets use IndependentSets instead.
The method iteratively calls method getIndependentSet.
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.
- conflictGraph - Graph
- the input graph