Examples of edu.ucla.sspace.graph.LinkClustering$EdgePair

edu.ucla.sspace.graph.LinkClustering
A structure for holding the indices of two {@link Edge} instances andtheir corresponding negative similarity. The similarity is negated so that when sorted, the edge pair with the highest similarity appears at the front of the {@link PriorityQueue}.

                graph = GraphIO.readUndirectedFromWeighted(
                    f, vertexLabels, opts.getDoubleOption('W'));
            else
                GraphIO.readUndirected(f, vertexLabels);


            LinkClustering lc = new LinkClustering();
            MultiMap<Integer,Integer> clusterToVertices = 
                lc.cluster(graph, System.getProperties());


            PrintWriter pw = new PrintWriter(
                new BufferedOutputStream(new FileOutputStream(
                                         opts.getPositionalArg(1))));

View Full Code Here

TOP

Related Classes of edu.ucla.sspace.graph.LinkClustering$EdgePair

edu.ucla.sspace.tools.LinkClusteringTool

edu.ucla.sspace.util.primitive.IntIterator

edu.ucla.sspace.util.primitive.IntSet

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.