Uses of Interface
com.yworks.yfiles.algorithms.Groups.INodeDistanceProvider

Packages that use Groups.INodeDistanceProvider

Package	Description
com.yworks.yfiles.algorithms	Provides the yFiles library's most fundamental classes and interfaces that model an efficient graph data type (class Graph), its nodes and edges (classes Node and Edge), and related container structures and iteration mechanisms (class YList and interface ICursor).

Uses of Groups.INodeDistanceProvider in com.yworks.yfiles.algorithms

Methods in com.yworks.yfiles.algorithms with parameters of type Groups.INodeDistanceProvider

Modifier and Type	Method and Description
static Groups.Dendrogram	Groups.hierarchicalClustering(Graph graph, Groups.INodeDistanceProvider distances, Linkage linkage) Partitions the graph into clusters based on hierarchical clustering.
static int	Groups.hierarchicalClustering(Graph graph, INodeMap clusterIDs, Groups.INodeDistanceProvider distances, Linkage linkage, double cutOff) Partitions the graph into clusters based on hierarchical clustering, while the dendrogram is cut based on a given cut-off value.
static int	Groups.hierarchicalClustering(Graph graph, int maxCluster, INodeMap clusterIDs, Groups.INodeDistanceProvider distances, Linkage linkage) Partitions the graph into clusters based on hierarchical clustering, while the dendrogram is cut based on a given maximum number of clusters.