alun.graph
Class DirectedNetwork<V,E>
java.lang.Object
alun.graph.AbstractGraph<V,E>
alun.graph.Network<V,E>
alun.graph.DirectedNetwork<V,E>
- All Implemented Interfaces:
- Graph<V,E>, MutableGraph<V,E>
- Direct Known Subclasses:
- Decomposition, MarriageNodeMap
public class DirectedNetwork<V,E>
- extends Network<V,E>
| Methods inherited from class alun.graph.AbstractGraph |
add, clear, connect, connects, contains, disconnect, disconnect, getVertices, inNeighbours, outNeighbours, remove |
| Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
DirectedNetwork
public DirectedNetwork()
getNeighbours
public java.util.Collection<V> getNeighbours(java.lang.Object x)
- Specified by:
getNeighbours in interface Graph<V,E>- Overrides:
getNeighbours in class Network<V,E>
getEdges
public java.util.Collection<E> getEdges()
- Specified by:
getEdges in interface Graph<V,E>- Overrides:
getEdges in class Network<V,E>
next
public V next(java.lang.Object x)
toString
public java.lang.String toString()
- Overrides:
toString in class Network<V,E>