javatools.datatypes

Class DirectedGraph.Node<E extends java.lang.Comparable<E>>

java.lang.Object

javatools.datatypes.DirectedGraph.Node<E>

All Implemented Interfaces:

java.lang.Comparable<DirectedGraph.Node<E>>

Enclosing class:

DirectedGraph<E extends java.lang.Comparable<E>>

public static class DirectedGraph.Node<E extends java.lang.Comparable<E>>
extends java.lang.Object
implements java.lang.Comparable<DirectedGraph.Node<E>>

Represents a node of in a graph

Field Summary

Fields

Modifier and Type	Field and Description
protected java.util.SortedSet<DirectedGraph.Node<E>>	children Points to the children of thise node
protected E	label Holds the label of node
protected java.util.SortedSet<DirectedGraph.Node<E>>	parents Points to the parents of this node

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	Node(E l, boolean directed) Created a node with a label -- in a directed or undirected graph

Method Summary

Modifier and Type	Method and Description
void	addChild(DirectedGraph.Node<E> child) Adds a child
void	addLink(DirectedGraph.Node<E> node) Adds a node in an undirected graph
void	addParent(DirectedGraph.Node<E> parent) Adds a parents
java.util.SortedSet<DirectedGraph.Node<E>>	ancestors() Computes the ancestors of this node
protected void	ancestors(java.util.Set<DirectedGraph.Node<E>> ancestors) Helper method
java.util.Set<DirectedGraph.Node<E>>	children() Returns the children
protected void	closure(java.util.Set<DirectedGraph.Node<E>> ancestors) Helper for Graph.makeClosure
int	compareTo(DirectedGraph.Node<E> arg0)
java.util.Set<DirectedGraph.Node<E>>	descendants() Computes the ancestors of this node
protected void	descendants(java.util.Set<DirectedGraph.Node<E>> descendants) Helper method
boolean	equals(java.lang.Object o)
int	hashCode()
E	label() Returns the label
java.util.Set<DirectedGraph.Node<E>>	links() returns the links in an undirected graph
java.util.Set<DirectedGraph.Node<E>>	parents() Returns the parents
java.lang.String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Field Detail

parents

protected java.util.SortedSet<DirectedGraph.Node<E extends java.lang.Comparable<E>>> parents

Points to the parents of this node

children

protected java.util.SortedSet<DirectedGraph.Node<E extends java.lang.Comparable<E>>> children

Points to the children of thise node

label

protected E extends java.lang.Comparable<E> label

Holds the label of node

Constructor Detail

Node

protected Node(E l,
               boolean directed)

Created a node with a label -- in a directed or undirected graph

Method Detail

equals

public boolean equals(java.lang.Object o)

Overrides:

equals in class java.lang.Object

addChild

public void addChild(DirectedGraph.Node<E> child)

Adds a child

addParent

public void addParent(DirectedGraph.Node<E> parent)

Adds a parents

addLink

public void addLink(DirectedGraph.Node<E> node)

Adds a node in an undirected graph

links

public java.util.Set<DirectedGraph.Node<E>> links()

returns the links in an undirected graph

children

public java.util.Set<DirectedGraph.Node<E>> children()

Returns the children

parents

public java.util.Set<DirectedGraph.Node<E>> parents()

Returns the parents

hashCode

public int hashCode()

Overrides:

hashCode in class java.lang.Object

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

closure

protected void closure(java.util.Set<DirectedGraph.Node<E>> ancestors)

Helper for Graph.makeClosure

ancestors

public java.util.SortedSet<DirectedGraph.Node<E>> ancestors()

Computes the ancestors of this node

ancestors

protected void ancestors(java.util.Set<DirectedGraph.Node<E>> ancestors)

Helper method

descendants

public java.util.Set<DirectedGraph.Node<E>> descendants()

Computes the ancestors of this node

descendants

protected void descendants(java.util.Set<DirectedGraph.Node<E>> descendants)

Helper method

compareTo

public int compareTo(DirectedGraph.Node<E> arg0)

Specified by:

compareTo in interface java.lang.Comparable<DirectedGraph.Node<E extends java.lang.Comparable<E>>>

label

public E label()

Returns the label