Package ptolemy.graph.analysis

Graph analysis classes.

See:
Description

Class Summary

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

Exception Summary

AnalysisException	Base exception for non-checked exceptions in the analyses package.
InvalidAnalyzerException	Invalid analyzer plugged into an analysis.

Package ptolemy.graph.analysis Description

Graph analysis classes.

Since:

Ptolemy II 0.2