public enum Linkage extends Enum<Linkage>
Enum Constant and Description |
---|
AVERAGE
A specifier for average-linkage clustering.
|
COMPLETE
A specifier for complete-linkage clustering.
|
SINGLE
A specifier for single-linkage clustering.
|
Modifier and Type | Method and Description |
---|---|
static Linkage |
fromOrdinal(int ordinal) |
int |
value() |
static Linkage |
valueOf(String name)
Returns the enum constant of this type with the specified name.
|
static Linkage[] |
values()
Returns an array containing the constants of this enum type, in
the order they are declared.
|
public static final Linkage AVERAGE
At the beginning, each element belongs to its own cluster. At each step of the clustering algorithm the two most "similar" clusters are combined and the distance between them is defined as the average all distances between the nodes that belong to the two clusters that are combined. The algorithm continues until all nodes belong to the same cluster.
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage)
,
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, int, com.yworks.yfiles.algorithms.INodeMap, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage)
,
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, com.yworks.yfiles.algorithms.INodeMap, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage, double)
public static final Linkage COMPLETE
At the beginning, each element belongs to its own cluster. At each step of the clustering algorithm the two most "dissimilar" clusters are merged and the distance equals to the distance of those two nodes that are farthest away from each other. The algorithm continues until all nodes belong to the same cluster.
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage)
,
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, int, com.yworks.yfiles.algorithms.INodeMap, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage)
,
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, com.yworks.yfiles.algorithms.INodeMap, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage, double)
public static final Linkage SINGLE
At the beginning, each element belongs to its own cluster. At each step of the clustering algorithm the two most "similar" clusters are merged together until all nodes belong to the same cluster.
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage)
,
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, int, com.yworks.yfiles.algorithms.INodeMap, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage)
,
Groups.hierarchicalClustering(com.yworks.yfiles.algorithms.Graph, com.yworks.yfiles.algorithms.INodeMap, com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider, Linkage, double)
public static final Linkage fromOrdinal(int ordinal)
public int value()
public static Linkage valueOf(String name)
IllegalArgumentException
- if this enum type has no constant with the specified nameNullPointerException
- if the argument is nullname
- the name of the enum constant to be returned.public static Linkage[] values()
for (Linkage c : Linkage.values()) System.out.println(c);