See: Description
| Class | Description |
|---|---|
| AbstractLabeling |
An abstract base class for generic labeling algorithms which place labels of graphs.
|
| AbstractMISLabeling |
A base class for generic labeling algorithms which solve the labeling problem by reducing it to the maximum independent
set (MIS) problem.
|
| GenericLabeling |
A generic labeling algorithm for placing the labels of a graph.
|
| LabelingData |
Specifies custom data for the
GenericLabeling. |
| Enum | Description |
|---|---|
| OptimizationStrategy |
Provides algorithms for the automatic placement of node and edge labels, so called generic labeling algorithms.
Labeling algorithms only place the labels of a graph. Positions of nodes and edges are not changed. The algorithms are especially useful if a graph already has a good layout of nodes and edges, but labels need to be arranged in a separate step. If, for example, a layout algorithm which does not offer sufficient labeling support is used, then generic labeling algorithms can be applied in a second step.
GenericLabeling calculates high quality label positions by default. If running time matters most, its internal calculation can be switched to very fast but more simple algorithm that can result in less nice placements.
See the yFiles Developer's Guide section on Automatic Label Placement.
GenericLabeling