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 | 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.
|
ConnectedComponents.EdgeFilter | |
Dijkstra |
Dijkstra's algorithm computes the shortest paths from a given node called
source to all the other nodes in a graph.
|
Dijkstra.Data | |
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.
|
PageRank |
The PageRank is an algorithm that measures the "importance" of the nodes in a
graph.
|
Parameter |
Defines a parameter as an association between a String and an Object.
|
Parameter.ParametersProcessor |
Defines the object which will process parameters.
|
Prim |
Compute a spanning tree using the Prim algorithm.
|
Prim.Data | |
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.
|
TarjanStronglyConnectedComponents.NodeData |
Internal data associated to nodes in computation.
|
Toolkit |
Lots of small often used algorithms on graphs.
|
Toolkit.BronKerboschIterator<T extends Node> | |
Toolkit.DegenEntry | |
Toolkit.StackElement<T extends Node> | |
Toolkit.WeightComparator |
Compare nodes by their weighted degree.
|
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
|
DStar.Tag | |
Spectrum.EigenValuesAlgorithm |
Exception | Description |
---|---|
InvalidParameterException | |
MissingParameterException |
A parameter is missing during the processing.
|
NotInitializedException |
Annotation Type | Description |
---|---|
DefineParameter |
Annotation allowing to define parameters in algorithm.
|
WebARTS Library Licensed Under the GNU - General Public License. Other Libraries licensed under their respective Open Source Licenses