| Class | Description |
|---|---|
| Demo | |
| DistanceMatrix |
A matrix of all distances in a graph.
|
| DistanceMatrixAlgorithm | |
| DistanceMatrixBasedDiameterAlgorithm |
Computes the diameter of the graph.
|
| FloydWarshallAlgorithm | |
| FourSweepIterativeFringeDiameterAlgorithm |
Computes the diameter of the graph using the heuristic algorithm proposed by
Pierluigi Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi and Andrea
Marino in “On computing the diameter of real-world undirected
graphs”.
|
| GirthAlgorithm | |
| MinimumEccentricityGraphCenter | |
| PageRank |
The page rank value for every vertex in the graph.
|
| PredecessorMatrix | |
| PredecessorMatrixAlgorithm | |
| StackBasedBellmanFordWeightedMatrixAlgorithm | |
| TwoSweepBFSDiameterApproximationAlgorithm |
Computes the two-sweeps approximated diameter of the graph.
|
| TwoSweepsGraphCenter | |
| UnweightedDistanceMatrixAlgorithm | |
| UnweightedPredecessorMatrixAlgorithm | |
| WeightedDistanceMatrixAlgorithm | |
| WeightedPredecessorMatrixAlgorithm |