|
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 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. |
| Edmonds |
|
| FibonacciHeap<K extends Comparable<K>,V> |
Fibonacci heap is a data structure used mainly to implement priority queues. |
| FixedArrayList<E> |
Array list with immutable element indices. |
| Kruskal |
Compute a spanning tree using the Kruskal algorithm. |
| Prim |
Compute a spanning tree using the Prim algorithm. |
| 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. |