public static class TopologicalSort.DirectedGraph<T> extends Object implements Iterable<T>
TopologicalSort.DirectedGraph()
void
addEdge(T from, T to)
boolean
addNode(T node)
edgeExists(T from, T to)
Set<T>
edgesFrom(T from)
isEmpty()
Iterator<T>
iterator()
removeEdge(T from, T to)
int
size()
String
toString()
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
public TopologicalSort.DirectedGraph()
public boolean addNode(T node)
public void addEdge(T from, T to)
public void removeEdge(T from, T to)
public boolean edgeExists(T from, T to)
public Set<T> edgesFrom(T from)
public Iterator<T> iterator()
iterator
Iterable<T>
public int size()
public boolean isEmpty()
public String toString()
toString
Object