Uses of Class
ptolemy.graph.Graph

Packages that use Graph

Package	Description
ptolemy.actor	Executable entities.
ptolemy.graph	Algorithms for manipulation and analyzing mathematical graphs.
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.

Uses of Graph in ptolemy.actor

Methods in ptolemy.actor that return Graph

Modifier and Type	Method and Description
protected Graph	GraphReader._initializeGraph(CompositeActor compositeActor) Instantiate and initialize a graph just prior to filling it in from a given Ptolemy II model.
Graph	GraphReader.convert(CompositeActor compositeActor) Convert the model represented by a CompositeActor into a directed, weighted graph.

Methods in ptolemy.actor with parameters of type Graph

Modifier and Type	Method and Description
protected void	GraphReader._processNewEdge(Graph graph, Edge edge, IOPort sourcePort, IOPort sinkPort) Process a new edge corresponding to a given connection in a given graph.
protected void	GraphReader._processNewNode(Graph graph, Node node, Actor actor) Process a new node corresponding to a given actor in a given graph.
protected void	GraphReader._transformTopology(Graph graph) Perform post-processing on the entire graph to complete the conversion.

Uses of Graph in ptolemy.graph

Subclasses of Graph in ptolemy.graph

Modifier and Type	Class and Description
class	DirectedAcyclicGraph A directed acyclic graph (DAG).
class	DirectedGraph A directed graph.

Methods in ptolemy.graph that return Graph

Modifier and Type	Method and Description
protected Graph	Graph._emptyGraph() Return an empty graph that has the same run-time type as this graph.
Graph	Graph.cloneAs(Graph graph) Return a clone of this graph in the form of the argument graph type (i.e., the run-time type of the returned graph is that of the argument graph).
Graph	Graph.subgraph(java.util.Collection collection) Return the subgraph induced by a collection of nodes.
Graph	Graph.subgraph(java.util.Collection nodeCollection, java.util.Collection edgeCollection) Return the subgraph formed by a subset of nodes and a subset of edges.

Methods in ptolemy.graph with parameters of type Graph

Modifier and Type	Method and Description
protected static java.lang.String	GraphException._elementDump(java.lang.Object element, Graph graph, java.lang.String elementDescriptor) Return a dump of an element (Node, Edge, or weight) and the container graph suitable to be appended to an error message.
boolean	Graph.addGraph(Graph graph) Add a given graph to this graph.
static void	GraphElementException.checkEdge(Edge edge, Graph graph) Verify that an edge is in the container graph.
static void	GraphElementException.checkNode(Node node, Graph graph) Verify that a node is in the container graph.
Graph	Graph.cloneAs(Graph graph) Return a clone of this graph in the form of the argument graph type (i.e., the run-time type of the returned graph is that of the argument graph).
static java.lang.String	GraphException.elementDump(Element element, Graph graph) Return a dump of a graph element and the container graph suitable to be appended to an error message.
static java.lang.String	GraphException.graphDump(Graph graph) Return a dump of this graph suitable to be appended to an error message.

Constructors in ptolemy.graph with parameters of type Graph

Constructor and Description
ElementList(java.lang.String descriptor, Graph graph) Construct an empty element list.
ElementList(java.lang.String descriptor, Graph graph, int elementCount) Construct an empty element list with enough storage allocated for the specified number of elements.
GraphElementException(Element element, Graph graph, java.lang.String message) Constructor with arguments of element, graph, and a message.
GraphWeightException(java.lang.Object weight, Element element, Graph graph, java.lang.String message) Constructor with arguments of weight, element, graph, and a message.

Uses of Graph in ptolemy.graph.analysis

Methods in ptolemy.graph.analysis that return Graph

Modifier and Type	Method and Description
Graph	ClusterNodesAnalysis.clusterNodes() Return the clustered Graph.
Graph	Analysis.graph() The graph associated with the analysis.
Graph	MirrorTransformation.mirror() Create a mirror of the graph associated with this analyzer with the same runtime class.
Graph	MirrorTransformation.mirror(Graph graph, boolean cloneWeights) Return a mirror of this graph in the form of the argument graph type (i.e., the run-time type of the returned graph is that of the argument graph).

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

Modifier and Type	Method and Description
Graph	MirrorTransformation.mirror(Graph graph, boolean cloneWeights) Return a mirror of this graph in the form of the argument graph type (i.e., the run-time type of the returned graph is that of the argument graph).

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

Constructor and Description
AllPairShortestPathAnalysis(Graph graph, ToDoubleMapping edgeLength) Construct an instance of this class with a default analyzer.
ClusterNodesAnalysis(Graph graph, java.util.Collection nodeCollection, Node superNode) Construct an instance of this class for a given graph.
CycleExistenceAnalysis(Graph graph) Construct an instance of this class for a given graph, using a default analyzer that runs in O(N^3) in which N is the number of nodes.
CycleMeanAnalysis(Graph graph, ToDoubleMapping edgeLengths) Construct a maximum cycle mean analysis associated with a graph with a default analyzer.
MaximumProfitToCostRatioAnalysis(Graph graph, ToDoubleMapping edgeProfits, ToIntMapping edgeCosts) Construct an instance of this class using a default analyzer.
MirrorTransformation(Graph graph) Construct a transformation for a given graph with a default analyzer.
NegativeLengthCycleAnalysis(Graph graph, ToDoubleMapping edgeLengths) Construct an instance of this class using a default analyzer.
SelfLoopAnalysis(Graph graph) Construct an instance of this class for a given graph.
SingleSourceLongestPathAnalysis(Graph graph, Node startNode, ToDoubleMapping edgeLengths) Construct an instance of this class with a default analyzer.
SinkNodeAnalysis(Graph graph) Construct an instance of this class for a given graph.
SourceNodeAnalysis(Graph graph) Construct an instance of this class for a given graph.
TransitiveClosureAnalysis(Graph graph) Construct an instance of this class for a given graph with a default analyzer.
ZeroLengthCycleAnalysis(Graph graph, ToDoubleMapping edgeLengths) Construct an instance of this class using a default analyzer.

Uses of Graph in ptolemy.graph.analysis.analyzer

Methods in ptolemy.graph.analysis.analyzer that return Graph

Modifier and Type	Method and Description
Graph	ClusterNodesTransformer.clusterNodes() Return the clustered Graph.
Graph	GraphAnalyzer.graph() Return the graph associated with this analyzer.
Graph	MirrorTransformer.mirror() Create a mirror of the graph associated with this analyzer with the same runtime class.
Graph	MirrorTransformer.mirror(Graph graph, boolean cloneWeights) Return a mirror of this graph in the form of the argument graph type (i.e., the run-time type of the returned graph is that of the argument graph).

Methods in ptolemy.graph.analysis.analyzer with parameters of type Graph

Modifier and Type	Method and Description
Graph	MirrorTransformer.mirror(Graph graph, boolean cloneWeights) Return a mirror of this graph in the form of the argument graph type (i.e., the run-time type of the returned graph is that of the argument graph).

Uses of Graph in ptolemy.graph.analysis.strategy

Methods in ptolemy.graph.analysis.strategy that return Graph

Modifier and Type	Method and Description
Graph	ClusterNodesTransformerStrategy.clusterNodes() Return the clustered Graph.
Graph	CachedStrategy.graph() The graph associated with the Strategy.
Graph	MirrorTransformerStrategy.mirror() Create a mirror of the graph associated with this analyzer with the same runtime class.
Graph	MirrorTransformerStrategy.mirror(Graph graph, boolean cloneWeights) Return a mirror of this graph in the form of the argument graph type (i.e., the run-time type of the returned graph is that of the argument graph).

Methods in ptolemy.graph.analysis.strategy with parameters of type Graph

Modifier and Type	Method and Description
Graph	MirrorTransformerStrategy.mirror(Graph graph, boolean cloneWeights) Return a mirror of this graph in the form of the argument graph type (i.e., the run-time type of the returned graph is that of the argument graph).

Constructors in ptolemy.graph.analysis.strategy with parameters of type Graph

Constructor and Description
AllEdgeSingleSourceLongestPathStrategy(Graph graph, Node startNode, ToDoubleMapping edgeLengths) Construct an instance of this analyzer.
CachedStrategy(Graph graph) No instance of this object can be created as it is abstract.
ClusterNodesTransformerStrategy(Graph graph, java.util.Collection nodeCollection, Node superNode) Construct a clusterer for a given graph.
FloydWarshallAllPairShortestPathStrategy(Graph graph, ToDoubleMapping edgeLengths) Construct an AllPairShortestPathAnalyzer which works using the Floyd-Warshall strategy.
FloydWarshallCycleExistenceStrategy(Graph graph) Construct an instance of this analyzer for a given graph.
FloydWarshallNegativeLengthCycleStrategy(Graph graph, ToDoubleMapping edgeLengths) Constructs negative cycle detection analyzer for a given graph and given edge values.
FloydWarshallStrategy(Graph graph) Construct an FloydWarshallStrategy.
FloydWarshallTransitiveClosureStrategy(Graph graph) Construct a transitive closure analysis for a given directed graph.
FloydWarshallZeroLengthCycleStrategy(Graph graph, ToDoubleMapping edgeLengths) Constructs negative cycle detection analyzer for a given graph and given edge values.
KarpCycleMeanStrategy(Graph graph, ToDoubleMapping edgeLengths) Construct a maximum cycle mean analyzer for a given graph, using the Karp's algorithm.
MirrorTransformerStrategy(Graph graph) Construct a transformer for a given graph.
ParhiMaximumProfitToCostRatioStrategy(Graph graph, ToDoubleMapping edgeProfits, ToIntMapping edgeCosts) Construct an instance of this class.
SelfLoopStrategy(Graph graph) Construct an instance of this strategy for a given graph.
SinkNodeStrategy(Graph graph) Construct a sink node analysis for a given graph.
SourceNodeStrategy(Graph graph) Construct an instance of this strategy for a given graph.