Package org.graphstream.algorithm

Interface Summary

Interface	Description
Algorithm	Algorithms are used to compute properties on graphs or graph elements.
APSP.Progress	Interface allowing to be notified of the algorithm progress.
AStar.Costs	the distance between the current position and the target.
BetweennessCentrality.Progress	Interface allowing to be notified of the algorithm progress.
DynamicAlgorithm	Defines algorithms able to handle dynamics of a graph.
SpanningTree	This interface defines the basic functionalities of a spanning tree algorithm.
TarjanStronglyConnectedComponents.IndexGenerator	Defines objects able to generator index.

Class Summary

Class	Description
AbstractSpanningTree	Base for spanning tree algorithms.
AlgorithmComputationTrigger	Provides a way to trigger the computation of an algorithm according to a type of events.
APSP	All-pair shortest paths lengths.
APSP.APSPInfo	Information stored on each node of the graph giving the length of the shortest paths toward each other node.
APSP.TargetPath	Description of a path to a target node.
AStar	An implementation of the A* algorithm.
AStar.DefaultCosts	An implementation of the Costs interface that provides a default heuristic.
AStar.DistanceCosts	An implementation of the Costs interface that assume that the weight of edges is an Euclidean distance in 2D or 3D.
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).
BetweennessCentrality	Compute the "betweenness" centrality of each vertex of a given graph.
Centroid	Compute the centroid of a connected graph.
ConnectedComponents	Compute and update the number of connected components of a dynamic graph.
Dijkstra	Dijkstra's algorithm computes the shortest paths from a given node called source to all the other nodes in a graph.
DStar	An implementation of the D* algorithm.
Eccentricity	Compute the eccentricity of a connected graph.
FixedArrayList<E>	Array list with immutable element indices.
Kruskal	Compute a spanning tree using the Kruskal algorithm.
LongestPath	Implementation of longest path algorithm in a DAG (directed acyclic graph) using topologicalSort
PageRank	The PageRank is an algorithm that measures the "importance" of the nodes in a graph.
Prim	Compute a spanning tree using the Prim algorithm.
Spectrum
TarjanStronglyConnectedComponents	Tarjan's Algorithm is a graph theory algorithm for finding the strongly connected components of a graph.
TarjanStronglyConnectedComponents.IntegerIndexGenerator	Defines an index generator producing a sequence of integer as indexes.
Toolkit	Lots of small often used algorithms on graphs.
TopologicalSortDFS	Implementation of depth first search algorithm for a topological sorting of a directed acyclic graph (DAG).
TopologicalSortKahn	Implementation of Kahn's algorithm for a topological sorting of a directed acyclic graph (DAG).

Enum Summary

Enum	Description
AlgorithmComputationTrigger.Mode	Defines when the computation is triggered.
Dijkstra.Element	This enumeration is used to specify how the length of a path is computed
Spectrum.EigenValuesAlgorithm

Exception Summary

Exception	Description
InvalidParameterException
MissingParameterException	A parameter is missing during the processing.
NotInitializedException