Uses of Interface
ptolemy.graph.analysis.analyzer.GraphAnalyzer

Packages that use GraphAnalyzer

Package	Description
ptolemy.graph.analysis	Graph analysis classes.
ptolemy.graph.analysis.analyzer	The ptolemy.graph.analysis.analyzer package.
ptolemy.graph.analysis.strategy	The ptolemy.graph.analysis.strategy package.
ptolemy.graph.sched	The ptolemy.graph.sched package.

Uses of GraphAnalyzer in ptolemy.graph.analysis

Methods in ptolemy.graph.analysis that return GraphAnalyzer

Modifier and Type	Method and Description
GraphAnalyzer	Analysis.analyzer() Return the analyzer associated with this analysis class.

Methods in ptolemy.graph.analysis with parameters of type GraphAnalyzer

Modifier and Type	Method and Description
void	Analysis.changeAnalyzer(GraphAnalyzer analyzer) Change the analyzer associated with this analysis class to the given analyzer.

Constructors in ptolemy.graph.analysis with parameters of type GraphAnalyzer

Constructor and Description
Analysis(GraphAnalyzer analyzer) Construct an analysis using a given analyzer.

Uses of GraphAnalyzer in ptolemy.graph.analysis.analyzer

Subinterfaces of GraphAnalyzer in ptolemy.graph.analysis.analyzer

Modifier and Type	Interface and Description
interface	AllPairShortestPathAnalyzer An interface for all the analyzers that compute the all pair shortest path of a directed graph.
interface	ClusterNodesTransformer Base interface for cluster transformers for graphs.
interface	CycleExistenceAnalyzer A common interface for all the cycle existence analyzers.
interface	CycleMeanAnalyzer A common interface for all the cycle mean analyzers.
interface	MaximumProfitToCostRatioAnalyzer A common interface for all the maximum profit to cost analyzers.
interface	MirrorTransformer Base interface for a mirror transformer for graphs.
interface	NegativeLengthCycleAnalyzer A common interface for all the negative length cycle analyzers.
interface	SelfLoopAnalyzer Base interface for the computation of self-loops in a graph.
interface	SingleSourceLongestPathAnalyzer A common interface for all the single source longest path analyzers.
interface	SinkNodeAnalyzer Base interface for the computation of sink nodes in a graph.
interface	SourceNodeAnalyzer Base interface for the computation of source nodes in a graph.
interface	Transformer A base interface for transformers.
interface	TransitiveClosureAnalyzer An interface to the analyzers for the computation of transitive closure of a directed graph.
interface	ZeroLengthCycleAnalyzer A common interface for all the zero length cycle detection analyzers.

Uses of GraphAnalyzer in ptolemy.graph.analysis.strategy

Classes in ptolemy.graph.analysis.strategy that implement GraphAnalyzer

Modifier and Type	Class and Description
class	AllEdgeSingleSourceLongestPathStrategy An analyzer used to find the longest path from a single source.
class	CachedStrategy A base class for cached analyzers on graphs.
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.

Uses of GraphAnalyzer in ptolemy.graph.sched

Subinterfaces of GraphAnalyzer in ptolemy.graph.sched

Modifier and Type	Interface and Description
interface	ScheduleAnalyzer An interface for all the scheduling strategies on graphs.