Partitions the graph into groups using edge betweenness centrality (see EdgeBetweenness(Graph, IEdgeMap, Boolean, IDataProvider) .Namespace: yWorks.yFiles.Algorithms
Assembly: yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 22.214.171.124
- Type: yWorks.yFiles.Algorithms..::..Graph
the input graph.
- Type: yWorks.yFiles.Algorithms..::..INodeMap
used as return value. This map gets a cluster ID of integer type for every node.
whether or not to consider the edges of the graph as directed.
the minimum number of groups to be returned.
the maximum number of groups to be returned. The smaller this value is chosen the faster the overall computation time. Note that the upper bound on the number of groups is graph.N(). Note, that the number of returned groups is never less than the number of connected components of the graph.
- Type: yWorks.yFiles.Algorithms..::..IDataProvider
if nullNothingnullptra null reference (Nothing in Visual Basic) the edges of the graph are considered to have equal cost. Otherwise it must provide a non-negative double value (its cost) for every edge.
Return Valuethe number of different groups found.
Partitions the graph into groups using edge betweenness centrality (see EdgeBetweenness(Graph, IEdgeMap, Boolean, IDataProvider) . In each iteration the edge with the highest betweenness centrality is removed from the graph. The method stops, if there are no more edges to remove. The clustering with the best quality reached during the process will be returned.O(graph.E())*O(edgeBetweenness) (Note: is practical faster because edge betweenness is computed for subgraphs during the process and this algorithm terminates after maxGroupCount groups have been determined.)