Uses of Class
ptolemy.graph.Node

Packages that use Node

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 Node in ptolemy.actor

Methods in ptolemy.actor with parameters of type Node

Modifier and Type	Method and Description
protected void	GraphReader._processNewNode(Graph graph, Node node, Actor actor) Process a new node corresponding to a given actor in a given graph.

Uses of Node in ptolemy.graph

Methods in ptolemy.graph that return Node

Modifier and Type	Method and Description
Node	Graph.addNode() Add an unweighted node to this graph.
Node	Graph.addNode(Node node) Add a pre-constructed node (unweighted or weighted).
Node	Graph.addNodeWeight(java.lang.Object weight) Add a new weighted node to this graph given the node weight.
Node	Graph.node(int label) Return a node in this graph given the node label.
Node	Graph.node(java.lang.Object weight) Return a node in this graph that has a specified weight.
Node	Edge.sink() Return the sink node of the edge.
Node	Edge.source() Return the source node of the edge.

Methods in ptolemy.graph with parameters of type Node

Modifier and Type	Method and Description
protected Edge	DirectedAcyclicGraph._addEdge(Node node1, Node node2, boolean weighted, java.lang.Object weight) Create and add an edge with a specified source node, sink node, and optional weight.
protected Edge	Graph._addEdge(Node node1, Node node2, boolean weighted, java.lang.Object weight) Create and add an edge with a specified source node, sink node, and optional weight.
protected void	Graph._connect(Edge edge, Node node) Connect an edge to a node by appropriately modifying the adjacency information associated with the node.
protected void	DirectedGraph._connect(Edge edge, Node node) Connect an edge to a node by appropriately modifying the adjacency information associated with the node.
protected void	DirectedGraph._connectedSubGraph(Node node, DirectedGraph graph, java.util.Collection remainingNodes) Given a node, get all the edges and nodes that are connected to it directly and/or indirectly.
protected void	Graph._disconnect(Edge edge, Node node) Disconnect an edge from a node that it is incident to.
protected void	DirectedGraph._disconnect(Edge edge, Node node)
protected void	Graph._registerNode(Node node) Register a new node in the graph.
protected void	DirectedGraph._registerNode(Node node) Register a new node in the graph.
Edge	Graph.addEdge(Node node1, Node node2) Add an unweighted edge between two nodes.
Edge	Graph.addEdge(Node node1, Node node2, java.lang.Object weight) Add a weighted edge between two nodes.
Node	Graph.addNode(Node node) Add a pre-constructed node (unweighted or weighted).
java.util.Collection	DirectedGraph.backwardReachableNodes(Node node) Find all the nodes that can be reached backward from the specified node.
static void	GraphElementException.checkNode(Node node, Graph graph) Verify that a node is in the container graph.
boolean	Graph.containsNode(Node node) Return True if the specified node exists in the graph.
boolean	DirectedGraph.edgeExists(Node node1, Node node2) Test if an edge exists from one node to another.
int	Graph.incidentEdgeCount(Node node) Return the number of edges that are incident to a specified node.
java.util.Collection	Graph.incidentEdges(Node node) Return the set of incident edges for a specified node.
int	DirectedGraph.inputEdgeCount(Node node) Return the number of input edges of a specified node.
java.util.Collection	DirectedGraph.inputEdges(Node node) Return the collection of input edges for a specified node.
java.util.Collection	Graph.neighborEdges(Node node1, Node node2) Return the collection of edges that make a node node2 a neighbor of a node node1.
java.util.Collection	Graph.neighbors(Node node) Return all of the neighbors of a given node in the form of a a collection.
int	Graph.nodeLabel(Node node) Return the node label of the specified node.
int	DirectedGraph.outputEdgeCount(Node node) Return the number of output edges of a specified node.
java.util.Collection	DirectedGraph.outputEdges(Node node) Return the collection of output edges for a specified node.
java.util.Collection	DirectedGraph.predecessorEdges(Node n1, Node n2) Return the collection of edges that make a node n2 a predecessor of a node n1.
java.util.Collection	DirectedGraph.predecessors(Node node) Return all of the predecessors of a given node in the form of a a collection.
java.util.Collection	DirectedGraph.reachableNodes(Node node) Find all the nodes that can be reached from the specified node.
boolean	Graph.removeNode(Node node) Remove a node from this graph if it exists in the graph.
int	Graph.selfLoopEdgeCount(Node node) Return the number of self loop edges of a specified node.
int	DirectedGraph.selfLoopEdgeCount(Node node) Return the number of self loop edges of a specified node.
java.util.Collection	Graph.selfLoopEdges(Node node) Return the collection of all self-loop edges that are incident to a specified node.
java.util.Collection	DirectedGraph.successorEdges(Node n1, Node n2) Return the collection of edges that make a node n2 a successor of a node n1.
java.util.Collection	DirectedGraph.successors(Node node) Return all of the successors of a given node in the form of a a collection.
boolean	Graph.validateWeight(Node node) Validate the weight of a node.
boolean	Graph.validateWeight(Node node, java.lang.Object oldWeight) Validate the weight of a node given the node and its previous weight.

Constructors in ptolemy.graph with parameters of type Node

Constructor and Description
Edge(Node source, Node sink) Construct an unweighted edge with a specified source node and sink node.
Edge(Node source, Node sink, java.lang.Object weight) Construct a weighted edge with a specified source node, sink node, and edge weight.

Uses of Node in ptolemy.graph.analysis

Methods in ptolemy.graph.analysis that return Node

Modifier and Type	Method and Description
Node	SingleSourceLongestPathAnalysis.getStartNode() Return the single source-node (start node) of this analyzer.

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

Modifier and Type	Method and Description
java.util.List	SingleSourceLongestPathAnalysis.path(Node endNode) Return the longest path from node "startNode" to node "endNode" in the form of an ordered list.
boolean	TransitiveClosureAnalysis.pathExistence(Node startNode, Node endNode) Check if there exist a path between a starting node "startNode" and an ending node "endNode" on the graph under analysis.
double	SingleSourceLongestPathAnalysis.pathLength(Node endNode) Return the length of the longest path from node "startNode" to node "endNode".
void	SingleSourceLongestPathAnalysis.setStartNode(Node startNode) Set the start-node of this analysis to the given node.
java.util.List	AllPairShortestPathAnalysis.shortestPath(Node startNode, Node endNode) Return the nodes on the shortest path from the node "startNode" to the node "endNode" in the form of an ordered list.
double	AllPairShortestPathAnalysis.shortestPathLength(Node startNode, Node endNode) Return the length of the shortest path from the node startNode to the node endNode.

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

Constructor and Description
ClusterNodesAnalysis(Graph graph, java.util.Collection nodeCollection, Node superNode) 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.

Uses of Node in ptolemy.graph.analysis.analyzer

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

Modifier and Type	Method and Description
Node	SingleSourceLongestPathAnalyzer.getStartNode() Return the start node of this analyzer.

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

Modifier and Type	Method and Description
java.util.List	SingleSourceLongestPathAnalyzer.path(Node endNode) Return the longest path from node "startNode" to node "endNode" in the form of an ordered list.
boolean	TransitiveClosureAnalyzer.pathExistence(Node startNode, Node endNode) Check if there exist a path between a starting node "startNode" and an ending node "endNode" on the graph under analysis.
double	SingleSourceLongestPathAnalyzer.pathLength(Node endNode) Return the length of the longest path from node "startNode" to node "endNode".
void	SingleSourceLongestPathAnalyzer.setStartNode(Node startNode) Set the single source node of this analyzer to the given node.
java.util.List	AllPairShortestPathAnalyzer.shortestPath(Node startNode, Node endNode) Return the nodes on the shortest path from the node "startNode" to the node "endNode" in the form of an ordered list.
double	AllPairShortestPathAnalyzer.shortestPathLength(Node startNode, Node endNode) Return the length of the shortest path from the node startNode to the node endNode.

Uses of Node in ptolemy.graph.analysis.strategy

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

Modifier and Type	Method and Description
Node	AllEdgeSingleSourceLongestPathStrategy.getStartNode() Return the single source-node (start node) of this analyzer.

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

Modifier and Type	Method and Description
java.util.List	AllEdgeSingleSourceLongestPathStrategy.path(Node endNode) Return the longest path from node startNode to node endNode in the form of an ordered list.
boolean	FloydWarshallTransitiveClosureStrategy.pathExistence(Node startNode, Node endNode) Check if there exist a path between a starting node and an ending node on the analyzer's graph.
double	AllEdgeSingleSourceLongestPathStrategy.pathLength(Node endNode) Return the length of the longest path from node startNode to node endNode.
void	AllEdgeSingleSourceLongestPathStrategy.setStartNode(Node startNode) Set the single source node (starting node) of this analyzer to the given node.
java.util.List	FloydWarshallAllPairShortestPathStrategy.shortestPath(Node startNode, Node endNode) Return the nodes on the shortest path from the node startNode to the node endNode in the form of an ordered list.
double	FloydWarshallAllPairShortestPathStrategy.shortestPathLength(Node startNode, Node endNode) Return the length of the shortest path from the node startNode to the node endNode.

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

Constructor and Description
AllEdgeSingleSourceLongestPathStrategy(Graph graph, Node startNode, ToDoubleMapping edgeLengths) Construct an instance of this analyzer.
ClusterNodesTransformerStrategy(Graph graph, java.util.Collection nodeCollection, Node superNode) Construct a clusterer for a given graph.