public class DirectedAcyclicGraph<T> extends Object implements TraversableGraph<T>
| Constructor and Description |
|---|
DirectedAcyclicGraph(MutableDirectedGraph<T> graph) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(Object other) |
com.google.common.collect.ImmutableSet<T> |
getIncomingNodesFor(T sink) |
com.google.common.collect.ImmutableSet<T> |
getNodes() |
com.google.common.collect.ImmutableSet<T> |
getNodesWithNoIncomingEdges() |
com.google.common.collect.ImmutableSet<T> |
getNodesWithNoOutgoingEdges() |
com.google.common.collect.ImmutableSetMultimap<T,T> |
getOutgoingEdges() |
com.google.common.collect.ImmutableSet<T> |
getOutgoingNodesFor(T source) |
int |
hashCode() |
public DirectedAcyclicGraph(MutableDirectedGraph<T> graph)
public com.google.common.collect.ImmutableSet<T> getOutgoingNodesFor(T source)
getOutgoingNodesFor in interface TraversableGraph<T>Iterable that the caller is not allowed to mutate.public com.google.common.collect.ImmutableSet<T> getIncomingNodesFor(T sink)
getIncomingNodesFor in interface TraversableGraph<T>Iterable that the caller is not allowed to mutate.public com.google.common.collect.ImmutableSet<T> getNodesWithNoOutgoingEdges()
getNodesWithNoOutgoingEdges in interface TraversableGraph<T>Iterable that the caller is not allowed to mutate.public com.google.common.collect.ImmutableSet<T> getNodesWithNoIncomingEdges()
getNodesWithNoIncomingEdges in interface TraversableGraph<T>Iterable that the caller is not allowed to mutate.public com.google.common.collect.ImmutableSet<T> getNodes()
getNodes in interface TraversableGraph<T>