Uses of Class ptolemy.graph.analysis.Analysis

Packages that use Analysis
Package	Description
ptolemy.graph	Algorithms for manipulation and analyzing mathematical graphs.
ptolemy.graph.analysis	Graph analysis classes.
ptolemy.graph.sched	The ptolemy.graph.sched package.

Methods in ptolemy.graph with parameters of type Analysis
Modifier and Type	Method and Description
`void`	Graph.`addAnalysis(Analysis analysis)` Add an analysis to the list of analyses that this graph is associated with.

Subclasses of Analysis in ptolemy.graph.analysis
Modifier and Type	Class and Description
`class`	`AllPairShortestPathAnalysis` An analysis to compute of the all pair shortest path of a directed graph.
`class`	`ClusterNodesAnalysis` Given a collection of nodes in a graph, replace the subgraph induced by the nodes with a single node N.
`class`	`CycleExistenceAnalysis` Analyzes a directed graph and detects the existence of cycles.
`class`	`CycleMeanAnalysis` An analysis to calculate the maximum/minimum cycle mean of a directed cyclic graph.
`class`	`MaximumProfitToCostRatioAnalysis` Maximum profit to cost ratio analysis.
`class`	`MirrorTransformation` A mirror transformations on graphs.
`class`	`NegativeLengthCycleAnalysis` Analysis to check if a cyclic directed graph has a negative-length cycle.
`class`	`SelfLoopAnalysis` Computation of self-loops in a graph.
`class`	`SingleSourceLongestPathAnalysis` An analysis to find the longest path from a single source to all the other nodes in a directed graph.
`class`	`SinkNodeAnalysis` Computation of sink nodes in a graph.
`class`	`SourceNodeAnalysis` Computation of source nodes in a graph.
`class`	`TransitiveClosureAnalysis` An analysis for the computation of transitive closure of a directed graph.
`class`	`ZeroLengthCycleAnalysis` Analysis to check if a cyclic directed graph has a zero-length cycle.

Uses of Classptolemy.graph.analysis.Analysis