Uses of Interface
com.tensegrity.graph.model.Node

Packages that use Node

com.tensegrity.graph.algorithm
com.tensegrity.graph.event	This package contains the event related code which consists of Event classes, Listeners and Adapters for the later.
com.tensegrity.graph.model	Contains the graph model interface.
com.tensegrity.graph.persistence	GraphPersistence package.
com.tensegrity.graph.view	Contains the graph view interface.

Uses of Node in com.tensegrity.graph.algorithm

Methods in com.tensegrity.graph.algorithm that return Node

Node	NodePath.getStartNode()
Node	NodePath.getStopNode()
Node[]	NodePath.getPath()
Node	DFS.getDFSParent(Node node) Returns the parent of the node in the dfs forest or null.

Methods in com.tensegrity.graph.algorithm with parameters of type Node

void	BiconnectedDFS.startNode(Graph graph, Node node, Node father)
void	BiconnectedDFS.endNode(Graph graph, Node node, Node father)
void	BiconnectedDFS.beforeRecursion(Graph graph, Edge edge, Node node)
void	BiconnectedDFS.afterRecursion(Graph graph, Edge edge, Node node)
void	BiconnectedDFS.usedAdjacentNodeEncountered(Graph graph, Edge edge, Node node)
void	BiconnectedDFS.startDFSTree(Graph graph, Node node)
void	DFSVisitor.startNode(Graph graph, Node node, Node father) Callback invoked before the dfs algorithm processes a single node.
void	DFSVisitor.endNode(Graph graph, Node node, Node father) Callback invoked after the dfs algorithm has processed a single node (and all children recursively).
void	DFSVisitor.beforeRecursion(Graph graph, Edge edge, Node node) Callback invoked right before the recursion in the dfs algorithm.
void	DFSVisitor.afterRecursion(Graph graph, Edge edge, Node node) Callback invoked right after the recursion in the dfs algorithm.
void	DFSVisitor.usedAdjacentNodeEncountered(Graph graph, Edge edge, Node node) If the adjacent nodes of the current node are scanned and an already processed node is encountered, this method is invoked.
void	DFSVisitor.startDFSTree(Graph graph, Node node) Callback invoked each time a new dfs-tree is started in the dfs search forest.
void	BFSVisitorAdapter.visitNode(Graph graph, Node node, Node parent, int depth)
java.util.Map	SingleSourceAllPath.generatePathMap(Node node)
java.util.Map	SingleSourceAllPath.generatePathMap(Node node, int maximumPathLength)
int[]	SingleSourceShortestPath.apply(Graph graph, Node node) This algorithm will return an integer array of length |V| (number of nodes in the graph) that has the path costs to all nodes from the given start node.
java.util.Map	SingleSourceShortestPath.generatePathMap(Graph graph, Node node)
void	BFSVisitor.visitNode(Graph graph, Node node, Node parent, int depth) Invoked when a node is processed by the BFS.
void	DFSVisitorAdapter.startNode(Graph graph, Node node, Node father)
void	DFSVisitorAdapter.endNode(Graph graph, Node node, Node father)
void	DFSVisitorAdapter.beforeRecursion(Graph graph, Edge edge, Node node)
void	DFSVisitorAdapter.afterRecursion(Graph graph, Edge edge, Node node)
void	DFSVisitorAdapter.usedAdjacentNodeEncountered(Graph graph, Edge edge, Node node)
void	DFSVisitorAdapter.startDFSTree(Graph graph, Node node)
boolean	TopologicalSort.apply(Graph graph, Node[] order) Returns true if there is one or more cycles in the graph.
boolean	TopologicalSort.apply(Subgraph subgraph, Node[] order) Returns true if there is one or more cycles in the subgraph.
int	DFS.getDFSNumber(Node node) Returns the DFS order number of a given node.
Node	DFS.getDFSParent(Node node) Returns the parent of the node in the dfs forest or null.
void	DFS.apply(Graph graph, DFSVisitor visitor, Node startnode) Applies the DFS algorithm with the given starting node.
void	BFS.apply(Graph graph, BFSVisitor visitor, Node startnode) This starts a visit with the node startnode as the rootnode.
void	BFS.apply(Graph graph, BFSVisitor visitor, Node startnode, boolean allcomponents) This starts a visit with the node startnode as the rootnode.

Constructors in com.tensegrity.graph.algorithm with parameters of type Node

NodePath(Node[] path, Edge[] pathEdges)

Uses of Node in com.tensegrity.graph.event

Methods in com.tensegrity.graph.event that return Node

Node	NodeEvent.getNode() Returns the Node that caused the event.
Node	GraphEvent.getSubjectNode() Returns the associated Node of this event.

Constructors in com.tensegrity.graph.event with parameters of type Node

NodeEvent(int id, Graph graph, Node node)
Constructs a new NodeEvent.

NodeEvent(int id, Subgraph subgraph, Node node)
Constructs a new NodeEvent.

NodeEvent(int id, Graph graph, Node node, Port port)
Constructs a new NodeEvent.

NodeEvent(int id, Subgraph subgraph, Node node, Port port)
Constructs a new NodeEvent.

GraphEvent(int eventid, Graph graph, Node node, long nodeid)
Constructs a new GraphEvent.

GraphEvent(int eventid, Subgraph subgraph, Node node, long nodeid)
Constructs a new GraphEvent.

GraphEvent(int eventid, Graph graph, Subgraph subgraph, Node node, Edge edge, long nodeid, long edgeid)
Constructs a new GraphEvent.

GraphEvent(int eventid, Graph graph, Subgraph subgraph, Node node, Edge edge, long nodeid, long edgeid, Edge newedge1, Edge newedge2)
Constructs a new GraphEvent.

GraphEvent(int eventid, long nodeid, Node node, Graph graph, Subgraph subgraph, long edgeid, Edge edge, GraphObjectContainer edgeGOC, Edge newedge1, GraphObjectContainer newedge1GOC, Edge newedge2, GraphObjectContainer newedge2GOC)

Uses of Node in com.tensegrity.graph.model

Subinterfaces of Node in com.tensegrity.graph.model

interface

Subgraph This interface defines a nested Graph that appears to be a single Node from the perspective of its parent.

Methods in com.tensegrity.graph.model that return Node

static Node	GraphOperations.findRoot(Graph graph) Returns the root node of the given graph if it is a tree and has a single root, otherwise null is returned.
Node	Node.deepCopy() Returns a deep copy of the node.
abstract Node	GraphModelFactory.newNode(java.lang.String label, java.util.List ports) Creates a new Node object with the specified name.
abstract Node	GraphModelFactory.newNode(java.lang.String label, java.util.List ports, NodeInfo info) Constructs and returns a node object.
static Node	GraphModelFactory.makeDefaultNode(GraphModelFactory factory, java.lang.String label) Creates a new Node using the given GraphModelFactory instance and the given name.
static Node	GraphModelFactory.makeDefaultNode(GraphModelFactory factory, java.lang.String label, NodeInfo info) Utility method that creates a default node.
Node	Edge.getSource() Gets the Node at the source end of this Edge.
Node	Edge.getTarget() Gets the Node at the target end of this Edge.
Node	Edge.getOpposite(Node node) Returns the node of the Edge that is not the given Node.
Node	GraphObjectContainer.getNodeByID(long localId) Returns the Node with the given id.
Node[]	GraphObjectContainer.getNodeArray() Returns an array of all nodes, which is suitable for random access.

Methods in com.tensegrity.graph.model with parameters of type Node

Edge	Node.isConnectedFromNode(Node node) Determines whether this node is connected from the given node.
Edge	Node.isConnectedToNode(Node node) Determines whether this node is connected to the given node.
abstract Edge	GraphModelFactory.newEdge(Node source, Node target) Constructs and returns an Edge object.
abstract Edge	GraphModelFactory.newEdge(Node source, Node target, EdgeInfo info) Constructs and returns an Edge object.
NodeInfo	NodeInfo.deepCopy(Node destination) Must provide a method that makes a deep copy of the NodeInfo for deep-copies of graphs.
Edge	Edge.createIsolatedCopy(Node source, Node target) Copies the attributes of the edge and constructs a new object.
void	Edge.setSourceInternal(Node source) NOTE: This method is for internal use only and should never be invoked by the client.
void	Edge.setTargetInternal(Node target) NOTE: This method is for internal use only and should never be invoked by the client.
Edge	Edge.deepCopy(Node source, Node target) Returns a deep copy of the Edge.
Node	Edge.getOpposite(Node node) Returns the node of the Edge that is not the given Node.
void	GraphObjectContainer.addNodes(Node[] nodes) Convenience method to add several nodes to a GraphObjectContainer in one go.
void	GraphObjectContainer.addNode(Node node) Adds the given node to the GraphObjectContainer.
void	GraphObjectContainer.removeNode(Node node) Removes the given node from the GraphObjectContainer.
void	GraphObjectContainer.fireNodePreRemove(Node node) Fires a fireNodePreRemove event.
void	GraphObjectContainer.fireNodeRemoved(Node node, long previd) Fires a fireNodeRemoved event.
void	GraphObjectContainer.firePreEdgeSplitInternal(Node node, long oldEdgeID, Edge oldEdge, GraphObjectContainer oldEdgeGOC, Edge newEdge1, GraphObjectContainer newEdge1GOC, Edge newEdge2, GraphObjectContainer newEdge2GOC) Fires a pre-edge split event.
GraphEvent	GraphObjectContainer.fireEdgeSplitInternal(Node node, long oldEdgeID, Edge oldEdge, GraphObjectContainer oldEdgeGOC, Edge newEdge1, GraphObjectContainer newEdge1GOC, Edge newEdge2, GraphObjectContainer newEdge2GOC) Fires an edge split event.
void	GraphObjectContainer.firePreCascadeNodeDeleteInternal(Node node, Edge newEdge, GraphObjectContainer newEdgeGOC, Edge oldEdge1, GraphObjectContainer oldEdge1GOC, Edge oldEdge2, GraphObjectContainer oldEdge2GOC) Fires a pre-cascade node delete event.
GraphEvent	GraphObjectContainer.fireCascadeNodeDeleteInternal(Node node, Edge newEdge, GraphObjectContainer newEdgeGOC, Edge oldEdge1, GraphObjectContainer oldEdge1GOC, Edge oldEdge2, GraphObjectContainer oldEdge2GOC) Fires a cascade node delete event.
Port	Port.deepCopy(Node node) Makes a deep copy of the Port.

Uses of Node in com.tensegrity.graph.persistence

Methods in com.tensegrity.graph.persistence with parameters of type Node

abstract Serializer

GraphModelPersistenceFactory.newNodeSerializer(Node node, com.tensegrity.graph.defaultview.InternalIDPool poolIDs)

Uses of Node in com.tensegrity.graph.view

Methods in com.tensegrity.graph.view that return Node

Node	VisualNode.getNode() Returns the reference to the node this VisualNode is associated with.

Methods in com.tensegrity.graph.view with parameters of type Node

abstract VisualNode	GraphViewFactory.newVisualNode(Node node, java.util.List visualports, Composite composite) Creates a new VisualNode associated with the given model node and providing the given ports.
abstract VisualNode	GraphViewFactory.newVisualNode(Node node, java.util.List visualports, VisualNodeInfo info, Composite composite) Constructs and returns a new VisualNode object.
abstract VisualNode	GraphViewFactory.newVisualNode(Node node, GeometryDescriptor geometry) Constructs a new VisualNode object.
abstract VisualNode	GraphViewFactory.newVisualNode(Node node, VisualNodeInfo info, GeometryDescriptor geometry) Constructs a new VisualNode object.
static VisualNode	GraphViewFactory.makeDefaultVisualNode(GraphViewFactory factory, Node node, Composite composite) This method creates a default VisualNode instance.
static VisualNode	GraphViewFactory.makeDefaultVisualNode(GraphViewFactory factory, Node node, Composite composite, VisualNodeInfo info) This method creates a default VisualNode instance and associates a VisualNodeInfo object with it.
VisualNode	VisualNode.deepCopy(Node node) Returns a deep copy of this visual node which is associated with the given node.
void	VisualNode.deepCopyPorts(VisualGraph visualgraph, VisualNode visualnode, Node node) Performs a deep copy of the ports of this visualnode.