org.graphstream.algorithm.community
Class EpidemicCommunityAlgorithm
java.lang.Object
org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm
org.graphstream.algorithm.community.EpidemicCommunityAlgorithm
- All Implemented Interfaces:
- Algorithm, DynamicAlgorithm, org.graphstream.stream.AttributeSink, org.graphstream.stream.ElementSink, org.graphstream.stream.Sink
- Direct Known Subclasses:
- Leung, SyncEpidemicCommunityAlgorithm
public class EpidemicCommunityAlgorithm
- extends DecentralizedCommunityAlgorithm
This class implements the "Epidemic Community Detection Algorithm" as
presented by Raghavan et al. It also serves as base class for all
algorithms using the epidemic label propagation paradigm.
- Author:
- Guillaume-Jean Herbiet
- Scientific Reference :
- U. N. Raghavan, R. Albert, and S. Kumara, “Near Linear Time Al-
gorithm to Detect Community Structures in Large-scale Networks,”
Physical Review E (Statistical, Nonlinear, and Soft Matter
Physics), vol. 76, no. 3, 2007.
Method Summary |
void |
computeNode(org.graphstream.graph.Node node)
Perform computation of one iteration of the algorithm on a given node
using the epidemic label propagation algorithm. |
Methods inherited from class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm |
attributeChanged, compute, edgeAdded, edgeAttributeAdded, edgeAttributeChanged, edgeAttributeRemoved, edgeRemoved, getMarker, getRandom, graphAttributeAdded, graphAttributeChanged, graphAttributeRemoved, graphCleared, init, init, nodeAdded, nodeAttributeAdded, nodeAttributeChanged, nodeAttributeRemoved, nodeRemoved, setMarker, setRandom, staticMode, stepBegins, terminate |
EpidemicCommunityAlgorithm
public EpidemicCommunityAlgorithm()
EpidemicCommunityAlgorithm
public EpidemicCommunityAlgorithm(org.graphstream.graph.Graph graph)
EpidemicCommunityAlgorithm
public EpidemicCommunityAlgorithm(org.graphstream.graph.Graph graph,
String marker)
computeNode
public void computeNode(org.graphstream.graph.Node node)
- Perform computation of one iteration of the algorithm on a given node
using the epidemic label propagation algorithm.
- Specified by:
computeNode
in class DecentralizedCommunityAlgorithm
- Parameters:
node
- - Computational Complexity :
- k times the complexity of the communityScores() function,
where k is the average number of neighboring communities.
Copyright © 2011. All Rights Reserved.