All Packages  Class Hierarchy  This Package  Previous  Next  Index

Class relaaja.netlayout.VGJ.Graph

java.lang.Object
   |
   +----relaaja.netlayout.VGJ.Graph

public class Graph

extends Object

implements Cloneable

Author:

Larry Barowski

directed_

edges_

idHash_

lastTopId_

nodeList_

nodeList_ holds the graph

Graph()

construct empty graph

Graph(boolean)

construct empty graph with direction

adjustGroupChildren_(Node, double, double, double, double, double, double)

children(int)

clone()

makes a copy of the current graph

copy(Graph)

Copy the properties of another graph.

dummysToEdgePaths()

Convert dummy nodes to edge paths.

fillBackEdges_()

firstAvailable()

firstNode()

firstNodeIndex()

getEdge(int, int)

getEdgePathPoints(int, int)

Get the path points for an edge.

getEdges()

getIndexFromNode(Node)

getNodeFromId(int)

getNodeFromIndex(int)

highestIndex()

insertEdge(Edge)

Insert an edge.

insertEdge(int, int)

insert an edge between two nodes

insertEdge(int, int, DPoint3[])

Insert an edge with path points.

insertEdge(int, int, DPoint3[], String)

Insert an edge with path points and a label.

insertNode()

insert new node into graph; no initial connections

insertNode(boolean)

Insert new node or dummy node into the graph.

insertNodeAt(int)

insert new node into graph; into the nodelist at the index

isDirected()

function to determine the graph type (directed or undirected)

killGroup(Node)

markGroupChildren_(Node, boolean)

nextNode(Node)

nextNodeIndex(int)

nodeFromIndex(int)

numberOfNodes()

pack()

Re-index so the indexes go from 0 to number of nodes - 1.

parents(int)

removeEdge(Edge)

removeEdge(int, int)

remove the connection from n1 to n2 but leave the nodes in place

removeEdgePaths()

Eliminate edge paths.

removeFalseEdges_()

removeGroups()

removeNode(int)

remove the node from the graph(also removes the edges connected to it)

removeNode(Node)

remove the node from the graph

setDirected(boolean)

setNodeGroup(Node, Node)

validateIds()

 private NodeList nodeList_

nodeList_ holds the graph

 private Hashtable idHash_

 private boolean directed_

 private int lastTopId_

 private Hashtable edges_

 public Graph()

construct empty graph

 public Graph(boolean yesorno)

construct empty graph with direction

 private void validateIds()

 public boolean isDirected()

function to determine the graph type (directed or undirected)

Returns:

boolean value

 public Object clone()

makes a copy of the current graph

Returns:

copy of current graph

Overrides:

clone in class Object

 public void copy(Graph newgraph)

Copy the properties of another graph. This assumes the other graph will be subsequently deleted - otherwise use copy(clone(graph_to_copy)).

 public int insertNode()

insert new node into graph; no initial connections

Returns:

index of the new node

 public int insertNode(boolean dummy)

Insert new node or dummy node into the graph.

Returns:

index of the new node

 public Node getNodeFromIndex(int index)

Returns:

s the node at the 'index'

 public Node getNodeFromId(int id)

 public void insertNodeAt(int index) throws IOException

insert new node into graph; into the nodelist at the index

Parameters:

integer - index to place node

Returns:

nodeList_ with the new node

 public void removeNode(int n)

remove the node from the graph(also removes the edges connected to it)

 public void removeNode(Node nin)

remove the node from the graph

 public void insertEdge(int n1,
                        int n2)

insert an edge between two nodes

Parameters:

two - integers node indexes

 public void insertEdge(int n1,
                        int n2,
                        DPoint3 points[])

Insert an edge with path points.

 public void insertEdge(int n1,
                        int n2,
                        DPoint3 points[],
                        String label)

Insert an edge with path points and a label.

 public void insertEdge(Edge edge)

Insert an edge.

 public DPoint3[] getEdgePathPoints(int n1,
                                    int n2)

Get the path points for an edge.

 public Edge getEdge(int n1,
                     int n2)

 public void removeEdge(int n1,
                        int n2)

remove the connection from n1 to n2 but leave the nodes in place

Parameters:

integer - index of each node on the edge

 public void removeEdge(Edge edge)

 public Set parents(int n)

Parameters:

node - to get parents of

Returns:

s a set of all the nodes leading to n

 public Set children(int n)

Returns:

s a set of all the nodes n leads to

 public int numberOfNodes()

Returns:

s the number of nodes in the graph

 public Node firstNode()

Returns:

s the first node of the graph

 public Node nextNode(Node node)

Returns:

s the next node after node

 public int getIndexFromNode(Node node)

Returns:

s the integer value of the index for the node

 public int firstNodeIndex()

Returns:

s the index of the first node in graph.nodeList

 public int nextNodeIndex(int index)

Returns:

s the index of the next node after the current index

 public int firstAvailable()

 public int highestIndex()

 public void setDirected(boolean directed)

 private void fillBackEdges_()

 private void removeFalseEdges_()

 public void pack()

Re-index so the indexes go from 0 to number of nodes - 1.

 public void removeEdgePaths()

Eliminate edge paths.

 public void dummysToEdgePaths()

Convert dummy nodes to edge paths.

 public Enumeration getEdges()

 public Node nodeFromIndex(int index)

 private void adjustGroupChildren_(Node node,
                                   double dx,
                                   double dy,
                                   double dz,
                                   double rw,
                                   double rh,
                                   double rd)

 private void markGroupChildren_(Node node,
                                 boolean state)

 public void killGroup(Node node)

 public void setNodeGroup(Node node,
                          Node groupnode)

 public void removeGroups()

All Packages  Class Hierarchy  This Package  Previous  Next  Index