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

Packages that use LabelVertex

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	Provides classes for a multi-node, distributed algorithm 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 LabelVertex in com.sun.sgs.impl.service.nodemap.affinity

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

protected edu.uci.ics.jung.graph.UndirectedGraph<LabelVertex,WeightedEdge>	AbstractLPA.graph The graph in which we're finding communities.
protected List<LabelVertex>	AbstractLPA.vertices For now, we're only grabbing the vertices of interest at the start of the algorithm.

Methods in com.sun.sgs.impl.service.nodemap.affinity with parameters of type LabelVertex

protected abstract long	AbstractLPA.doOtherNeighbors(LabelVertex vertex, Map<Integer,Long> labelMap, StringBuilder logSB) Update the label map with any other neighbors known to a particular algorithm.
protected boolean	AbstractLPA.setMostFrequentLabel(LabelVertex vertex, boolean self) Sets the label of vertex to the label used most frequently by vertex's neighbors.

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

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.
protected static Set<AffinityGroup>	AbstractLPA.gatherGroups(List<LabelVertex> vertices, boolean reinitialize, long gen) Return the affinity groups found within the given vertices, putting all vertices with the same label in a group.

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

Methods in com.sun.sgs.impl.service.nodemap.affinity.dgb that return LabelVertex

LabelVertex	DistGraphBuilder.getVertex(Identity id) Gets the graph vertex for the given Identity.
LabelVertex	DistGraphBuilderServerImpl.getVertex(Identity id) Gets the graph vertex for the given Identity.

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

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 LabelVertex in com.sun.sgs.impl.service.nodemap.affinity.dlpa

Methods in com.sun.sgs.impl.service.nodemap.affinity.dlpa with parameters of type LabelVertex

protected long

LabelPropagation.doOtherNeighbors(LabelVertex vertex, Map<Integer,Long> labelMap, StringBuilder logSB) Update the label map with any other neighbors known to a particular algorithm.

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

Methods in com.sun.sgs.impl.service.nodemap.affinity.dlpa.graph that return LabelVertex

LabelVertex	WeightedGraphBuilder.getVertex(Identity id) Gets the graph vertex for the given Identity.
LabelVertex	BipartiteGraphBuilder.getVertex(Identity id) Gets the graph vertex for the given Identity.

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

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 LabelVertex in com.sun.sgs.impl.service.nodemap.affinity.graph

Methods in com.sun.sgs.impl.service.nodemap.affinity.graph that return LabelVertex

LabelVertex

AffinityGraphBuilder.getVertex(Identity id) Gets the graph vertex for the given Identity.

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

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 LabelVertex in com.sun.sgs.impl.service.nodemap.affinity.single

Methods in com.sun.sgs.impl.service.nodemap.affinity.single that return LabelVertex

LabelVertex

SingleGraphBuilder.getVertex(Identity id) Gets the graph vertex for the given Identity.

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

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.

Methods in com.sun.sgs.impl.service.nodemap.affinity.single with parameters of type LabelVertex

protected long

SingleLabelPropagation.doOtherNeighbors(LabelVertex vertex, Map<Integer,Long> labelMap, StringBuilder logSB) Update the label map with any other neighbors known to a particular algorithm.