Package org.graphstream.algorithm

Interface Summary
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 definition of an heuristic.
BetweennessCentrality.Progress Interface allowing to be notified of the algorithm progress.
DynamicAlgorithm Defines algorithms able to handle dynamics of a graph.
 

Class Summary
AbstractSpanningTree Base for spanning tree algorithms.
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 provide a default heuristic.
AStar.DistanceCosts An implementation of the Costs interface that assume that the weight of edges is an Euclidian 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 is a greedy algorithm that solves the single-source shortest path problem for a directed graph with non negative edge weights (Wikipedia).
Eccentricity Compute the eccentricity of a connected graph.
Kruskal Compute a spanning tree using the Kruskal algorithm.
Prim Compute a spanning tree using the Prim algorithm.
Toolkit Lots of small often used algorithms on graphs.
 

Enum Summary
Dijkstra.Element This enumeration help identifying the kind of element to be used to compute the shortest path.
 



Copyright © 2011. All Rights Reserved.