X-Git-Url: https://git.opendaylight.org/gerrit/gitweb?p=controller.git;a=blobdiff_plain;f=third-party%2Fnet.sf.jung2%2Fsrc%2Fmain%2Fjava%2Fedu%2Fuci%2Fics%2Fjung%2Falgorithms%2Fcluster%2Fpackage.html;fp=third-party%2Fnet.sf.jung2%2Fsrc%2Fmain%2Fjava%2Fedu%2Fuci%2Fics%2Fjung%2Falgorithms%2Fcluster%2Fpackage.html;h=f8bdb2279ac1fbc72facbc9d9812e6fe5643fa3d;hp=0000000000000000000000000000000000000000;hb=42210c03b0a4c54706320ba9f55794c0abd4d201;hpb=7576b38152b393793b1c9ec3df0ff86685f95236
diff --git a/third-party/net.sf.jung2/src/main/java/edu/uci/ics/jung/algorithms/cluster/package.html b/third-party/net.sf.jung2/src/main/java/edu/uci/ics/jung/algorithms/cluster/package.html
new file mode 100644
index 0000000000..f8bdb2279a
--- /dev/null
+++ b/third-party/net.sf.jung2/src/main/java/edu/uci/ics/jung/algorithms/cluster/package.html
@@ -0,0 +1,35 @@
+
+
+
+
+
+
+
+Mechanisms for identifying clusters in graphs. Where these clusters define disjoint sets of vertices,
+they may be used to define a VertexPartition for more convenient manipulation of the vertex/set
+relationships.
+
+Current clustering algorithms include:
+
+BicomponentClusterer: finds all subsets of vertices for which at least
+2 vertices must be removed in order to disconnect the induced subgraphs.
+EdgeBetweennessClusterer: identifies vertex clusters by removing the edges of the highest
+'betweenness' scores (see the importance/scoring package).
+VoltageClusterer: Clusters vertices based on their ranks as
+calculated by VoltageRanker.
+WeakComponentVertexClusterer: Clusters vertices based on their membership in weakly
+connected components of a graph.
+
+
+
+
+