|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Algorithm | |
---|---|
org.graphstream.algorithm | |
org.graphstream.algorithm.coloring | |
org.graphstream.algorithm.community | |
org.graphstream.algorithm.measure | |
org.graphstream.algorithm.randomWalk |
Uses of Algorithm in org.graphstream.algorithm |
---|
Subinterfaces of Algorithm in org.graphstream.algorithm | |
---|---|
interface |
DynamicAlgorithm
Defines algorithms able to handle dynamics of a graph. |
Classes in org.graphstream.algorithm that implement Algorithm | |
---|---|
class |
AbstractSpanningTree
Base for spanning tree algorithms. |
class |
APSP
All-pair shortest paths lengths. |
class |
AStar
An implementation of the A* algorithm. |
class |
BellmanFord
Implementation of the Bellman-Ford algorithm that computes single-source shortest paths in a weighted digraph The Bellman-Ford algorithm computes single-source shortest paths in a weighted digraph (where some of the edge weights may be negative). |
class |
BetweennessCentrality
Compute the "betweenness" centrality of each vertex of a given graph. |
class |
Centroid
Compute the centroid of a connected graph. |
class |
ConnectedComponents
Compute and update the number of connected components of a dynamic graph. |
class |
Dijkstra
Dijkstra's algorithm computes the shortest paths from a given node called source to all the other nodes in a graph. |
class |
DStar
An implementation of the D* algorithm. |
class |
Eccentricity
Compute the eccentricity of a connected graph. |
class |
Edmonds
|
class |
Kruskal
Compute a spanning tree using the Kruskal algorithm. |
class |
Prim
Compute a spanning tree using the Prim algorithm. |
class |
TarjanStronglyConnectedComponents
Tarjan's Algorithm is a graph theory algorithm for finding the strongly connected components of a graph. |
Uses of Algorithm in org.graphstream.algorithm.coloring |
---|
Classes in org.graphstream.algorithm.coloring that implement Algorithm | |
---|---|
class |
WelshPowell
Welsh Powell static graph coloring algorithm. |
Uses of Algorithm in org.graphstream.algorithm.community |
---|
Classes in org.graphstream.algorithm.community that implement Algorithm | |
---|---|
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 Algorithm in org.graphstream.algorithm.measure |
---|
Classes in org.graphstream.algorithm.measure that implement Algorithm | |
---|---|
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 Algorithm in org.graphstream.algorithm.randomWalk |
---|
Classes in org.graphstream.algorithm.randomWalk that implement Algorithm | |
---|---|
class |
RandomWalk
A random walk on a graph. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |