See: Description
Class | Description |
---|---|
AllEdgeSingleSourceLongestPathStrategy |
An analyzer used to find the longest path from a single source.
|
CachedStrategy |
A base class for cached analyzers on graphs.
|
ClusterNodesTransformerStrategy |
Strategy for cluster transformers for graphs.
|
FloydWarshallAllPairShortestPathStrategy |
Computation of the all pair shortest path of a directed graph using the
Floyd-Warshall algorithm.
|
FloydWarshallCycleExistenceStrategy |
Computation of cycle existence in directed graphs using an all pair shortest
path algorithm based on the Floyd-Warshall algorithm.
|
FloydWarshallNegativeLengthCycleStrategy |
Analyzer to check if a given directed graph has a negative cycle using the
Floyd-Warshall all pair shortest path algorithm.
|
FloydWarshallStrategy |
Base class for all the analysis based on a floyd-warshall like computation.
|
FloydWarshallTransitiveClosureStrategy |
Computation of transitive closure of a directed graph using the
Floyd-Warshall algorithm described in:
Thomas H.
|
FloydWarshallZeroLengthCycleStrategy |
Analyzer to check if a given directed graph has a zero cycle using the
Floyd-Warshall all pair shortest path algorithm.
|
KarpCycleMeanStrategy |
An analyzer for computing the maximum/minimum cycle mean of a graph.
|
MirrorTransformerStrategy |
A mirror transformer for graphs.
|
ParhiMaximumProfitToCostRatioStrategy |
Maximum profit to cost ratio analyzer which uses Parhi's algorithm for
iteration bound.
|
SelfLoopStrategy |
Computation of self-loops in a graph.
|
SinkNodeStrategy |
Computation of sink nodes in a graph.
|
SourceNodeStrategy |
Computation of source nodes in a graph.
|
Strategy |
A base class for all the strategies.
|