Uses of Interface
org.graphstream.algorithm.Algorithm

Packages that use Algorithm

Package	Description
org.graphstream.algorithm
org.graphstream.algorithm.coloring
org.graphstream.algorithm.community
org.graphstream.algorithm.flow
org.graphstream.algorithm.measure
org.graphstream.algorithm.networksimplex
org.graphstream.algorithm.randomWalk

Uses of Algorithm in org.graphstream.algorithm

Subinterfaces of Algorithm in org.graphstream.algorithm

Modifier and Type	Interface	Description
interface	DynamicAlgorithm	Defines algorithms able to handle dynamics of a graph.
interface	SpanningTree	This interface defines the basic functionalities of a spanning tree algorithm.

Classes in org.graphstream.algorithm that implement Algorithm

Modifier and Type	Class	Description
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
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	Kruskal	Compute a spanning tree using the Kruskal algorithm.
class	LongestPath	Implementation of longest path algorithm in a DAG (directed acyclic graph) using topologicalSort
class	PageRank	The PageRank is an algorithm that measures the "importance" of the nodes in a graph.
class	Prim	Compute a spanning tree using the Prim algorithm.
class	Spectrum
class	TarjanStronglyConnectedComponents	Tarjan's Algorithm is a graph theory algorithm for finding the strongly connected components of a graph.
class	TopologicalSortDFS	Implementation of depth first search algorithm for a topological sorting of a directed acyclic graph (DAG).
class	TopologicalSortKahn	Implementation of Kahn's algorithm for a topological sorting of a directed acyclic graph (DAG).

Constructors in org.graphstream.algorithm with parameters of type Algorithm

Constructor	Description
AlgorithmComputationTrigger(AlgorithmComputationTrigger.Mode mode, Algorithm algo)
NotInitializedException(Algorithm algo)

Uses of Algorithm in org.graphstream.algorithm.coloring

Classes in org.graphstream.algorithm.coloring that implement Algorithm

Modifier and Type	Class	Description
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

Modifier and Type	Class	Description
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.flow

Subinterfaces of Algorithm in org.graphstream.algorithm.flow

Modifier and Type	Interface	Description
interface	FlowAlgorithm	Defines algorithm used to compute maximum flow.

Classes in org.graphstream.algorithm.flow that implement Algorithm

Modifier and Type	Class	Description
class	EdmondsKarpAlgorithm
class	FlowAlgorithmBase	Base for flow algorithms.
class	FordFulkersonAlgorithm	The Ford-Fulkerson algorithm to compute maximum flow.

Uses of Algorithm in org.graphstream.algorithm.measure

Classes in org.graphstream.algorithm.measure that implement Algorithm

Modifier and Type	Class	Description
class	AbstractCentrality	Base class for centrality measures.
class	ChartConnectivityMeasure
static class	ChartConnectivityMeasure.ChartEdgeConnectivityMeasure
static class	ChartConnectivityMeasure.ChartVertexConnectivityMeasure
class	ClosenessCentrality	Compute closeness centrality.
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.
static class	ConnectivityMeasure.EdgeConnectivityMeasure
static class	ConnectivityMeasure.VertexConnectivityMeasure
class	DegreeCentrality
class	DegreeMeasure
class	EigenvectorCentrality
class	ElementCountMeasure
static class	ElementCountMeasure.EdgeCountMeasure	Measure the count of edges in a graph.
static class	ElementCountMeasure.NodeCountMeasure	Measure the count of nodes in a 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	SurpriseMeasure	Surprise measure.
class	VariationOfInformation

Uses of Algorithm in org.graphstream.algorithm.networksimplex

Classes in org.graphstream.algorithm.networksimplex that implement Algorithm

Modifier and Type	Class	Description
class	DynamicOneToAllShortestPath
class	NetworkSimplex	Minimum cost flow problem

Uses of Algorithm in org.graphstream.algorithm.randomWalk

Classes in org.graphstream.algorithm.randomWalk that implement Algorithm

Modifier and Type	Class	Description
class	RandomWalk	A random walk on a graph.