Uses of Class
com.tensegrity.graph.model.GraphException

Packages that use GraphException

com.tensegrity.graph.algorithm
com.tensegrity.graph.model	Contains the graph model interface.
com.tensegrity.graph.rule.handler	Handlers that can be registered and then activated in rules.

Uses of GraphException in com.tensegrity.graph.algorithm

Methods in com.tensegrity.graph.algorithm that throw GraphException

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)
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.
boolean	TopologicalSort.apply(Subgraph subgraph, Node[] order) Returns true if there is one or more cycles in the subgraph.
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.

Uses of GraphException in com.tensegrity.graph.model

Subclasses of GraphException in com.tensegrity.graph.model

class	IllegalEdgeException This exception is thrown if a link is illegal or illegaly referenced.
class	IllegalGraphException This exception is thrown if a graph is illegal.
class	IllegalNodeException This exception is thrown if a node is illegal or illegaly referenced within the context of a graph.
class	InappropriateGraphException This exception is thrown if a graph is inappropriate in a certain context.

Methods in com.tensegrity.graph.model that throw GraphException

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.
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 GraphException in com.tensegrity.graph.rule.handler

Methods in com.tensegrity.graph.rule.handler that throw GraphException

void	VisualSubgraphRemoveHandler.subgraphRemove(VisualSubgraphRemoveInfo info) Callback that is invoked when a subgraph remove occurs.
boolean	VisualNodeDropHandler.nodeDrop(VisualNodeDropInfo info) Callback that is invoked when a node-drop occurs.