|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use DynamicAlgorithm | |
---|---|
org.graphstream.algorithm | |
org.graphstream.algorithm.community | |
org.graphstream.algorithm.measure | |
org.graphstream.algorithm.randomWalk |
Uses of DynamicAlgorithm in org.graphstream.algorithm |
---|
Classes in org.graphstream.algorithm that implement DynamicAlgorithm | |
---|---|
class |
ConnectedComponents
Compute and update the number of connected components of a dynamic graph. |
Uses of DynamicAlgorithm in org.graphstream.algorithm.community |
---|
Classes in org.graphstream.algorithm.community that implement DynamicAlgorithm | |
---|---|
class |
DecentralizedCommunityAlgorithm
Base class for all distributed community detection algorithm. |
class |
EpidemicCommunityAlgorithm
This class implements the "Epidemic Community Detection Algorithm" as presented by Raghavan et al. |
class |
Leung
This class implements an improved community detection algorithm based on the epidemic label propagation paradigm the was presented by Leung et al. |
class |
SyncEpidemicCommunityAlgorithm
This class implements the synchronous version of the "Epidemic Community Detection Algorithm" as presented by Raghavan et al. |
Uses of DynamicAlgorithm in org.graphstream.algorithm.measure |
---|
Classes in org.graphstream.algorithm.measure that implement DynamicAlgorithm | |
---|---|
class |
CommunityDistribution
Provides some statistical information on the size of current community assignment on the specified graph as it evolves. |
class |
CommunityMeasure
Computes and updates an absolute measure based on the current community assignment on a given graph as it evolves. |
class |
CommunityRelativeMeasure
Computes and updates a relative measure based on the comparison between the current community assignment and a reference assignment on a given graph. |
class |
Modularity
Computes and updates the modularity of a given graph as it evolves. |
class |
NormalizedMutualInformation
Computes and updated the current Normalized Mutual Information (NMI) measure between a dynamically-performed community assignment on a graph as it evolves and a fixed assignment, known as reference. |
class |
VariationOfInformation
|
Uses of DynamicAlgorithm in org.graphstream.algorithm.randomWalk |
---|
Classes in org.graphstream.algorithm.randomWalk that implement DynamicAlgorithm | |
---|---|
class |
RandomWalk
A random walk on a graph. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |