y.layout.labeling
Class GreedyMISLabeling
java.lang.Object
|
+--y.layout.AbstractLayoutStage
|
+--y.layout.labeling.AbstractLabelingAlgorithm
|
+--y.layout.labeling.MISLabelingAlgorithm
|
+--y.layout.labeling.GreedyMISLabeling
- All Implemented Interfaces:
- Layouter, LayoutStage
- public class GreedyMISLabeling
- extends MISLabelingAlgorithm
This class places the labels of a graph using a greedy strategy.
This is the fastest label placing algorithm provided.
Method Summary |
protected NodeList |
solveMIS(y.layout.labeling.Label[] labels)
Solving the MIS Problem in a greedy fashion. |
Methods inherited from class y.layout.labeling.AbstractLabelingAlgorithm |
canLayout, doLayout, getPlaceEdgeLabels, getPlaceNodeLabels, getProfit, getRects, getRemoveEdgeOverlaps, getRemoveNodeOverlaps, getSelectionKey, isEdgeGroupOverlapAllowed, isStoreRects, label, label, label, removeEdgesOverlaps, removeNodesOverlaps, setEdgeGroupOverlapAllowed, setPlaceEdgeLabels, setPlaceNodeLabels, setProfitModel, setRemoveEdgeOverlaps, setRemoveNodeOverlaps, setSelection, setStoreRects |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
GreedyMISLabeling
public GreedyMISLabeling()
solveMIS
protected NodeList solveMIS(y.layout.labeling.Label[] labels)
- Solving the MIS Problem in a greedy fashion.
- Specified by:
solveMIS
in class MISLabelingAlgorithm