Uses of Class
javatools.datatypes.DirectedGraph.Node

Packages that use DirectedGraph.Node
javatools.datatypes   
 

Uses of DirectedGraph.Node in javatools.datatypes
 

Methods in javatools.datatypes that return DirectedGraph.Node
 DirectedGraph.Node<E> DirectedGraph.get(E label)
          Returns the node with the given label (or null)
 DirectedGraph.Node<E> DirectedGraph.getOrMake(E label)
          Returns or creates a node
 DirectedGraph.Node<E> UndirectedGraph.getOrMake(E label)
          Returns a node or creates it
 

Methods in javatools.datatypes that return types with arguments of type DirectedGraph.Node
 java.util.SortedSet<DirectedGraph.Node<E>> DirectedGraph.Node.ancestors()
          Computes the ancestors of this node
 java.util.Set<DirectedGraph.Node<E>> DirectedGraph.Node.children()
          Returns the children
 java.util.Set<DirectedGraph.Node<E>> DirectedGraph.Node.descendants()
          Computes the ancestors of this node
 java.util.SortedSet<DirectedGraph.Node<E>> DirectedGraph.leaves()
          Computes the nodes that have no leaves
 java.util.Set<DirectedGraph.Node<E>> DirectedGraph.Node.links()
          returns the links in an undirected graph
 java.util.Collection<DirectedGraph.Node<E>> DirectedGraph.nodes()
          Returns all nodes
 java.util.Set<DirectedGraph.Node<E>> DirectedGraph.Node.parents()
          Returns the parents
 java.util.SortedSet<DirectedGraph.Node<E>> DirectedGraph.roots()
          Computes the nodes that have no parents
 

Methods in javatools.datatypes with parameters of type DirectedGraph.Node
 void DirectedGraph.Node.addChild(DirectedGraph.Node<E> child)
          Adds a child
 void DirectedGraph.Node.addLink(DirectedGraph.Node<E> node)
          Adds a node in an undirected graph
 void DirectedGraph.Node.addParent(DirectedGraph.Node<E> parent)
          Adds a parents
 int DirectedGraph.Node.compareTo(DirectedGraph.Node<E> arg0)