| Package | com.yworks.yfiles.algo |
| Class | public class IndependentSets |
| Inheritance | IndependentSets  YObject Object |
| Method | Defined By | ||
|---|---|---|---|
IndependentSets(init:Boolean = true) | IndependentSets | ||
 | equals(o:Object):Boolean | YObject | |
getClass():Class [override] | IndependentSets | ||
[static]
Calculates an independent set for a given conflict graph (each pair of nodes of the independent set is non-adjacent in the conflict graph). | IndependentSets | ||
getIndependentSets(conflictGraph:Graph):Vector.<Object> [static]
Partitions the vertex set of the given conflict graph into independent sets. | IndependentSets | ||
| hashCode():int | YObject | |
| IndependentSets | () | Constructor |
Hide Inherited Public Methods
Show Inherited Public Methodspublic function IndependentSets(init:Boolean = true)init:Boolean (default = true) |
| getClass | () | method |
override public function getClass():ClassReturnsClass |
| getIndependentSet | () | method |
public static function getIndependentSet(conflictGraph:Graph):NodeListCalculates an independent set for a given conflict graph (each pair of nodes of the independent set is non-adjacent in the conflict graph). We use a greedy heuristic which tries to find a large independent set.
Precondition The input graph is simple, i.e. it contains neither multi-edges nor selfloops.
Parameters
conflictGraph:Graph — the input graph.
|
NodeList — a NodeList containing an independent set of nodes
|
| getIndependentSets | () | method |
public static function getIndependentSets(conflictGraph:Graph):Vector.<Object>Partitions the vertex set of the given conflict graph into independent sets.
Precondition The input graph is simple, i.e. it contains neither multi-edges nor selfloops.
Parameters
conflictGraph:Graph — the input graph.
|
Vector.<Object> — a NodeList array where each entry contains an independent set of nodes.
|
See also