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

Packages that use Graph

com.tensegrity.graph.algorithm
com.tensegrity.graph.controller	Graph Controller specification.
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.view	Contains the graph view interface.
com.tensegrity.gui.graphdocument	This package contains the GraphDocument interface, a Factory for creating such documents as well as a definition for a panel which may hold such documents.
com.tensegrity.gui.swing.dialog.graphtools
com.tensegrity.skeleton.commands	The command package contains all the predefined commands of the skeleton, like Save, Print, Quit, Zoom, etc.
com.tensegrity.skeleton.swt.commands

Uses of Graph in com.tensegrity.graph.algorithm

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

Graph	MinimumSpanningTree.apply(Graph input) Outputs a new graph that is a tree.
Graph	TransitiveClosure.apply(Graph input) Computes the transitive closure Graph for the given input Graph.
Graph	TransformAlgorithm.apply(Graph input) Applies a transform algorithm.

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

void	BiconnectedDFS.apply(Graph graph) Starts the algorithm.
void	BiconnectedDFS.startGraph(Graph graph)
void	BiconnectedDFS.endGraph(Graph graph)
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.backEdge(Graph graph, Edge edge)
void	BiconnectedDFS.usedAdjacentNodeEncountered(Graph graph, Edge edge, Node node)
void	BiconnectedDFS.startDFSTree(Graph graph, Node node)
void	DFSVisitor.startGraph(Graph graph) Callback invoked before the dfs algorithm starts its work.
void	DFSVisitor.endGraph(Graph graph) Callback invoked after the dfs algorithm completed its work.
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.backEdge(Graph graph, Edge edge) Callback invoked each time a backedge is encountered for the first time.
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.startGraph(Graph graph)
void	BFSVisitorAdapter.endGraph(Graph graph)
void	BFSVisitorAdapter.visitNode(Graph graph, Node node, Node parent, int depth)
void	BFSVisitorAdapter.visitEdge(Graph graph, Edge edge, boolean treeEdge)
Graph	MinimumSpanningTree.apply(Graph input) Outputs a new graph that is a tree.
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.startGraph(Graph graph) Callback invoked before the dfs algorithm starts its work.
void	BFSVisitor.endGraph(Graph graph) Callback invoked after the dfs algorithm completed its work.
void	BFSVisitor.visitNode(Graph graph, Node node, Node parent, int depth) Invoked when a node is processed by the BFS.
void	BFSVisitor.visitEdge(Graph graph, Edge edge, boolean treeEdge) Invoked when an edge is processed by the BFS.
void	DFSVisitorAdapter.startGraph(Graph graph)
void	DFSVisitorAdapter.endGraph(Graph graph)
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.backEdge(Graph graph, Edge edge)
void	DFSVisitorAdapter.usedAdjacentNodeEncountered(Graph graph, Edge edge, Node node)
void	DFSVisitorAdapter.startDFSTree(Graph graph, Node node)
Graph	TransitiveClosure.apply(Graph input) Computes the transitive closure Graph for the given input Graph.
boolean	TopologicalSort.apply(Graph graph, Node[] order) Returns true if there is one or more cycles in the graph.
void	DFS.apply(Graph graph, DFSVisitor visitor) Applies the DFS algorithm with an arbitrary starting node.
void	DFS.apply(Graph graph, DFSVisitor visitor, Node startnode) Applies the DFS algorithm with the given starting node.
Graph	TransformAlgorithm.apply(Graph input) Applies a transform algorithm.
void	BFS.apply(Graph graph, BFSVisitor visitor) This starts a visit with the node at index 0 as the rootnode.
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, boolean allcomponents) This starts a visit with the node at index 0 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.
int[]	AllPairsShortestPath.apply(Graph graph) Returns a |V| * |V| large 2-dimensional array that represents a matrix of all shortest paths in the graph.

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

SingleSourceAllPath(Graph graph, SingleSourceAllPathFeedback feedback)

Uses of Graph in com.tensegrity.graph.controller

Methods in com.tensegrity.graph.controller that return Graph

Graph

GraphController.getGraph() Returns the graph model instance that is being controlled.

Methods in com.tensegrity.graph.controller with parameters of type Graph

abstract GraphController	GraphControllerFactory.newClientServerGraphController(Graph graph) This method returns a new Client/Server- GraphController
abstract GraphController	GraphControllerFactory.newModelBasedGraphController(Graph graph) This method returns a new Model-Based- GraphController

Uses of Graph in com.tensegrity.graph.event

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

Graph

GraphRootEvent.getGraph() Returns the associated Graph of the event.

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

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

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

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

GraphEvent(int eventid, Graph graph, Edge edge, long edgeid)
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)

EdgeEvent(int id, Graph graph, Edge edge)
Constructs a new EdgeEvent.

Uses of Graph in com.tensegrity.graph.model

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

Graph	Subgraph.deepCopyGraph() Returns a deep copy of the subgraphs underlying Graph
Graph	Subgraph.getGraphInternal() This method is for internal use only.
Graph	Graph.deepCopy() Returns a deep independent copy of the Graph.
Graph	Graph.deepCopyWithoutNodesAndEdges() Copies this Graph and its type to a new empty Graph and omitting the nodes and edges.
Graph	Graph.deepCopyWithoutEdges() Copies this Graph and its type to a new empty Graph and omitting the edges.
static Graph	GraphGeneration.buildSubgraph(Graph graph, java.util.Iterator nodes, java.util.Iterator edges) Builds a subgraph from the given graph and the given lists of nodes and edges.
static Graph	GraphGeneration.gridGraph(int n) Generates a digraph that looks like a grid of size n * n.
static Graph	GraphGeneration.starGraph(int n) Generates a star-graph.
static Graph	GraphGeneration.treeGraph(int levels, int leavesPerNode) Generates a tree graph.
static Graph	GraphGeneration.treeGraph(int levels, int leavesPerNode, GraphGeneration.TreeRandomizer randomizer) Generates a tree graph.
static Graph	GraphGeneration.completeGraph(int n_nodes) Generates a complete graph.
static Graph	GraphGeneration.randomGraph(int n_nodes, int n_edges) Generates a random graph.
static Graph	GraphGeneration.randomCircular(int n_nodes) Generates a random-circular Graph.
static Graph	GraphGeneration.randomWorkflow(int n_nodes) Generates a random Graph with workflow characteristics.
static Graph	GraphGeneration.randomWorkflow_old(int n_nodes, int n_edges) Generates a random-workflow Graph.
static Graph	GraphGeneration.randomTree(int n_nodes) Generates a random-tree Graph.
abstract Graph	GraphModelFactory.newGraph() Constructs and returns a Graph object.

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

static boolean	GraphOperations.isConnected(Graph graph) Finds out whether the undirected instance of the given graph is connected.
static boolean	GraphOperations.isBiconnected(Graph graph) Returns true if the given undirected graph consists of one biconnected component only.
static boolean	GraphOperations.hasCycle(Graph graph) Checks whether the given directed graph has a cycle by means of topological searching.
static boolean	GraphOperations.isTree(Graph graph) Performs the full set of conditional checks to determine whether the given Graph is a tree and has at least one root.
static boolean	GraphOperations.isBinaryTree(Graph graph) Checks whether the graph is a binary tree.
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.
Subgraph	Subgraph.deepCopy(Graph graph) Returns a deep copy of the subgraph.
static Graph	GraphGeneration.buildSubgraph(Graph graph, java.util.Iterator nodes, java.util.Iterator edges) Builds a subgraph from the given graph and the given lists of nodes and edges.
abstract Subgraph	GraphModelFactory.newSubgraph(java.lang.String label, Graph graph) Constructs and returns a new Subgraph object.
abstract Subgraph	GraphModelFactory.newSubgraph(java.lang.String label, NodeInfo info, Graph graph) Constructs and returns a new Subgraph object.
static void	GraphManipulation.deleteRandomEdges(Graph graph, int n) Deletes n random edges from the graph.
static void	GraphManipulation.deleteRandomNodes(Graph graph, int n) Deletes n random nodes from the graph.
static void	GraphManipulation.addEdges(Graph graph, int n) Adds n edges to the graph.
static void	GraphManipulation.addNodes(Graph graph, int n) Adds n nodes to the graph.

Uses of Graph in com.tensegrity.graph.view

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

Graph

VisualGraph.getGraph() Returns the reference to the Graph this VisualGraph is associated with.

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

VisualGraph	VisualSubgraph.deepCopyVisualGraph(Graph graph) Returns a deep copy of the subgraphs underlying VisualGraph.
VisualGraph	VisualGraph.deepCopy(Graph graph) Makes a deep copy of the VisualGraph and registers the copy with the given Graph.
VisualGraph	VisualGraph.deepCopyWithoutNodesAndEdges(Graph graph) Makes a deep copy of the VisualGraph and registers the copy with the given Graph.
abstract VisualSubgraph	GraphViewFactory.newVisualSubgraph(Graph graph, Subgraph subgraph, GeometryDescriptor geometry) Constructs and returns a new VisualSubgraph object.
abstract VisualSubgraph	GraphViewFactory.newVisualSubgraph(Graph graph, Subgraph subgraph, VisualNodeInfo info, GeometryDescriptor geometry) Constructs and returns a new VisualSubgraph object.
abstract VisualGraph	GraphViewFactory.newVisualGraph(Graph graph, java.lang.String nodeGeometry, java.lang.String nodeStyle, java.lang.String edgeStyle) Constructs and returns a new VisualGraph.
abstract VisualGraph	GraphViewFactory.newVisualGraph(Graph graph) Creates a new VisualGraph associated with the given model graph.

Uses of Graph in com.tensegrity.gui.graphdocument

Methods in com.tensegrity.gui.graphdocument with parameters of type Graph

protected void

GraphPanelAttributableOnSetDelegate.updateGraphAttributes(Graph activegraph, VisualGraphView activevisualgraph) The method updateGraphAttributes adds all the Graph related attributes to the internal attributable instance.

Uses of Graph in com.tensegrity.gui.swing.dialog.graphtools

Methods in com.tensegrity.gui.swing.dialog.graphtools with parameters of type Graph

VisualGraph

GraphCreationListener.onCreateVisualGraph(Graph graph, boolean newwindow) This method will be called to notification listener that a visual graph is to create.

Uses of Graph in com.tensegrity.skeleton.commands

Methods in com.tensegrity.skeleton.commands with parameters of type Graph

GraphDocument

NewDocumentCommand.newDocument(Graph graph) Returns a new GraphDocument for the a given Graph.

Uses of Graph in com.tensegrity.skeleton.swt.commands

Methods in com.tensegrity.skeleton.swt.commands with parameters of type Graph

protected VisualGraphView

SwtNewDocumentCommand.newVisualGraphView(Graph graph) Creates and returns a new VisualGRaphView given the passed Graph.