public class DirectedGraphUnion<V,E> extends GraphUnion<V,E,DirectedGraph<V,E>> implements DirectedGraph<V,E>
Modifier and Type | Method and Description |
---|---|
java.util.Set<E> |
incomingEdgesOf(V vertex)
Returns a set of all edges incoming into the specified vertex.
|
int |
inDegreeOf(V vertex)
Returns the "in degree" of the specified vertex.
|
int |
outDegreeOf(V vertex)
Returns the "out degree" of the specified vertex.
|
java.util.Set<E> |
outgoingEdgesOf(V vertex)
Returns a set of all edges outgoing from the specified vertex.
|
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getG1, getG2, removeEdge, removeEdge, removeVertex, vertexSet
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet
public int inDegreeOf(V vertex)
DirectedGraph
inDegreeOf
in interface DirectedGraph<V,E>
vertex
- vertex whose degree is to be calculated.public java.util.Set<E> incomingEdgesOf(V vertex)
DirectedGraph
incomingEdgesOf
in interface DirectedGraph<V,E>
vertex
- the vertex for which the list of incoming edges to be
returned.public int outDegreeOf(V vertex)
DirectedGraph
outDegreeOf
in interface DirectedGraph<V,E>
vertex
- vertex whose degree is to be calculated.public java.util.Set<E> outgoingEdgesOf(V vertex)
DirectedGraph
outgoingEdgesOf
in interface DirectedGraph<V,E>
vertex
- the vertex for which the list of outgoing edges to be
returned.