public class Graph<T>
extends java.lang.Object
| Modifier and Type | Class | Description |
|---|---|---|
static class |
Graph.Node<T> |
| Constructor | Description |
|---|---|
Graph(java.util.Comparator<Graph.Node<T>> comparator) |
| Modifier and Type | Method | Description |
|---|---|---|
void |
addNode(T tm) |
|
void |
addPredecessor(T tm,
T predecessor) |
|
java.util.List<T> |
findPredecessors(T o) |
|
java.util.Set<T> |
getIndependentNodes() |
|
java.util.Set<T> |
getNeighbors(T t) |
|
java.util.Collection<T> |
getNodeValues() |
|
java.util.Set<T> |
getPredecessors(T node) |
|
java.util.List<T> |
getStrictlySortedNodes() |
|
boolean |
isIndependent(T object) |
|
void |
topologicalSort() |
|
java.lang.String |
toString() |
public Graph(java.util.Comparator<Graph.Node<T>> comparator)
public void addNode(T tm)
public boolean isIndependent(T object)
public java.util.Collection<T> getNodeValues()
public java.util.Set<T> getIndependentNodes()
public java.util.List<T> getStrictlySortedNodes()
public void topologicalSort()
public java.util.List<T> findPredecessors(T o)
o - public java.lang.String toString()
toString in class java.lang.Object