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