Class and Description |
---|
AbstractSpanningTree
Base for spanning tree algorithms.
|
Algorithm
Algorithms are used to compute properties on graphs or graph elements.
|
AlgorithmComputationTrigger.Mode
Defines when the computation is triggered.
|
APSP.APSPInfo
Information stored on each node of the graph giving the length of the
shortest paths toward each other node.
|
APSP.Progress
Interface allowing to be notified of the algorithm progress.
|
APSP.TargetPath
Description of a path to a target node.
|
AStar.Costs
the distance between the current position and the target.
|
BetweennessCentrality.Progress
Interface allowing to be notified of the algorithm progress.
|
ConnectedComponents.ConnectedComponent
A representation of a connected component.
|
Dijkstra.Element
This enumeration is used to specify how the length of a path is computed
|
DynamicAlgorithm
Defines algorithms able to handle dynamics of a graph.
|
Kruskal
Compute a spanning tree using the Kruskal algorithm.
|
SpanningTree
This interface defines the basic functionalities of a spanning tree algorithm.
|
Spectrum.EigenValuesAlgorithm |
TarjanStronglyConnectedComponents.IndexGenerator
Defines objects able to generator index.
|
Class and Description |
---|
Algorithm
Algorithms are used to compute properties on graphs or graph elements.
|
Class and Description |
---|
Algorithm
Algorithms are used to compute properties on graphs or graph elements.
|
DynamicAlgorithm
Defines algorithms able to handle dynamics of a graph.
|
Class and Description |
---|
Algorithm
Algorithms are used to compute properties on graphs or graph elements.
|
Class and Description |
---|
Algorithm
Algorithms are used to compute properties on graphs or graph elements.
|
DynamicAlgorithm
Defines algorithms able to handle dynamics of a graph.
|
Class and Description |
---|
Algorithm
Algorithms are used to compute properties on graphs or graph elements.
|
DynamicAlgorithm
Defines algorithms able to handle dynamics of a graph.
|
Class and Description |
---|
Algorithm
Algorithms are used to compute properties on graphs or graph elements.
|
DynamicAlgorithm
Defines algorithms able to handle dynamics of a graph.
|