| Package | Description |
|---|---|
| javatools.datatypes |
| Modifier and Type | Field and Description |
|---|---|
protected SortedSet<DirectedGraph.Node<E>> |
DirectedGraph.Node.children
Points to the children of thise node
|
protected Map<E,DirectedGraph.Node<E>> |
DirectedGraph.nodes
Holds the nodes
|
protected SortedSet<DirectedGraph.Node<E>> |
DirectedGraph.Node.parents
Points to the parents of this node
|
| Modifier and Type | Method and Description |
|---|---|
DirectedGraph.Node<E> |
DirectedGraph.get(E label)
Returns the node with the given label (or null)
|
DirectedGraph.Node<E> |
UndirectedGraph.getOrMake(E label)
Returns a node or creates it
|
DirectedGraph.Node<E> |
DirectedGraph.getOrMake(E label)
Returns or creates a node
|
| Modifier and Type | Method and Description |
|---|---|
SortedSet<DirectedGraph.Node<E>> |
DirectedGraph.Node.ancestors()
Computes the ancestors of this node
|
Set<DirectedGraph.Node<E>> |
DirectedGraph.Node.children()
Returns the children
|
Set<DirectedGraph.Node<E>> |
DirectedGraph.Node.descendants()
Computes the ancestors of this node
|
SortedSet<DirectedGraph.Node<E>> |
DirectedGraph.leaves()
Computes the nodes that have no leaves
|
Set<DirectedGraph.Node<E>> |
DirectedGraph.Node.links()
returns the links in an undirected graph
|
Collection<DirectedGraph.Node<E>> |
DirectedGraph.nodes()
Returns all nodes
|
Set<DirectedGraph.Node<E>> |
DirectedGraph.Node.parents()
Returns the parents
|
SortedSet<DirectedGraph.Node<E>> |
DirectedGraph.roots()
Computes the nodes that have no parents
|
| Modifier and Type | Method and Description |
|---|---|
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) |
| Modifier and Type | Method and Description |
|---|---|
protected void |
DirectedGraph.Node.ancestors(Set<DirectedGraph.Node<E>> ancestors)
Helper method
|
protected void |
DirectedGraph.Node.closure(Set<DirectedGraph.Node<E>> ancestors)
Helper for Graph.makeClosure
|
protected void |
DirectedGraph.Node.descendants(Set<DirectedGraph.Node<E>> descendants)
Helper method
|
Copyright © 2018. All rights reserved.