Uses of Class
com.sun.sgs.impl.service.nodemap.affinity.graph.WeightedEdge

Packages that use WeightedEdge

com.sun.sgs.impl.service.nodemap.affinity	Provides classes, interfaces, and utilities used to find affinity groups with the label propagation algorithm (LPA).
com.sun.sgs.impl.service.nodemap.affinity.dgb	Provides classes for a multi-node distributed graph builder implementation of the label propagation algorithm described in "Near linear time algorithm to detect community structures in large-scale networks" by Raghavan, Albert and Kumara (2007).
com.sun.sgs.impl.service.nodemap.affinity.dlpa.graph	Provides classes used to create the graphs for the fully distributed label propagation algorithm implementation.
com.sun.sgs.impl.service.nodemap.affinity.graph	Provides classes used to build graphs used by the label propagation algorithm (LPA).
com.sun.sgs.impl.service.nodemap.affinity.single	Provides classes for a single node implementation of the label propagation algorithm described in "Near linear time algorithm to detect community structures in large-scale networks" by Raghavan, Albert and Kumara (2007).

Uses of WeightedEdge in com.sun.sgs.impl.service.nodemap.affinity

Fields in com.sun.sgs.impl.service.nodemap.affinity with type parameters of type WeightedEdge

protected edu.uci.ics.jung.graph.UndirectedGraph<LabelVertex,WeightedEdge>

AbstractLPA.graph The graph in which we're finding communities.

Method parameters in com.sun.sgs.impl.service.nodemap.affinity with type arguments of type WeightedEdge

static double

AffinityGroupGoodness.calcModularity(edu.uci.ics.jung.graph.Graph<LabelVertex,WeightedEdge> graph, Collection<AffinityGroup> groups) Given a graph and a set of partitions of it, calculate the modularity.

Uses of WeightedEdge in com.sun.sgs.impl.service.nodemap.affinity.dgb

Methods in com.sun.sgs.impl.service.nodemap.affinity.dgb that return types with arguments of type WeightedEdge

edu.uci.ics.jung.graph.UndirectedGraph<LabelVertex,WeightedEdge>	DistGraphBuilder.getAffinityGraph() Returns the current graph, with identities as vertices, and edges representing each object accessed by both identity endpoints.
edu.uci.ics.jung.graph.UndirectedGraph<LabelVertex,WeightedEdge>	DistGraphBuilderServerImpl.getAffinityGraph() Returns the current graph, with identities as vertices, and edges representing each object accessed by both identity endpoints.

Uses of WeightedEdge in com.sun.sgs.impl.service.nodemap.affinity.dlpa.graph

Methods in com.sun.sgs.impl.service.nodemap.affinity.dlpa.graph that return types with arguments of type WeightedEdge

edu.uci.ics.jung.graph.UndirectedGraph<LabelVertex,WeightedEdge>	WeightedGraphBuilder.getAffinityGraph() Returns the current graph, with identities as vertices, and edges representing each object accessed by both identity endpoints.
edu.uci.ics.jung.graph.UndirectedGraph<LabelVertex,WeightedEdge>	BipartiteGraphBuilder.getAffinityGraph() Returns the current graph, with identities as vertices, and edges representing each object accessed by both identity endpoints.

Uses of WeightedEdge in com.sun.sgs.impl.service.nodemap.affinity.graph

Methods in com.sun.sgs.impl.service.nodemap.affinity.graph that return types with arguments of type WeightedEdge

edu.uci.ics.jung.graph.UndirectedGraph<LabelVertex,WeightedEdge>

AffinityGraphBuilder.getAffinityGraph() Returns the current graph, with identities as vertices, and edges representing each object accessed by both identity endpoints.

Uses of WeightedEdge in com.sun.sgs.impl.service.nodemap.affinity.single

Methods in com.sun.sgs.impl.service.nodemap.affinity.single that return types with arguments of type WeightedEdge

edu.uci.ics.jung.graph.UndirectedGraph<LabelVertex,WeightedEdge>

SingleGraphBuilder.getAffinityGraph() Returns the current graph, with identities as vertices, and edges representing each object accessed by both identity endpoints.