Package org.jgrapht.graph
Class DirectedGraphUnion<V,E>
- java.lang.Object
-
- org.jgrapht.graph.AbstractGraph<V,E>
-
- org.jgrapht.graph.GraphUnion<V,E,DirectedGraph<V,E>>
-
- org.jgrapht.graph.DirectedGraphUnion<V,E>
-
- All Implemented Interfaces:
java.io.Serializable,DirectedGraph<V,E>,Graph<V,E>
public class DirectedGraphUnion<V,E> extends GraphUnion<V,E,DirectedGraph<V,E>> implements DirectedGraph<V,E>
- See Also:
- Serialized Form
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.Set<E>incomingEdgesOf(V vertex)Returns a set of all edges incoming into the specified vertex.intinDegreeOf(V vertex)Returns the "in degree" of the specified vertex.intoutDegreeOf(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.-
Methods inherited from class org.jgrapht.graph.GraphUnion
addEdge, addEdge, addVertex, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, getG1, getG2, removeEdge, removeEdge, removeVertex, vertexSet
-
Methods inherited from class org.jgrapht.graph.AbstractGraph
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets
-
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface org.jgrapht.Graph
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet
-
-
-
-
Method Detail
-
inDegreeOf
public int inDegreeOf(V vertex)
Description copied from interface:DirectedGraphReturns the "in degree" of the specified vertex. An in degree of a vertex in a directed graph is the number of inward directed edges from that vertex. See http://mathworld.wolfram.com/Indegree.html.- Specified by:
inDegreeOfin interfaceDirectedGraph<V,E>- Parameters:
vertex- vertex whose degree is to be calculated.- Returns:
- the degree of the specified vertex.
-
incomingEdgesOf
public java.util.Set<E> incomingEdgesOf(V vertex)
Description copied from interface:DirectedGraphReturns a set of all edges incoming into the specified vertex.- Specified by:
incomingEdgesOfin interfaceDirectedGraph<V,E>- Parameters:
vertex- the vertex for which the list of incoming edges to be returned.- Returns:
- a set of all edges incoming into the specified vertex.
-
outDegreeOf
public int outDegreeOf(V vertex)
Description copied from interface:DirectedGraphReturns the "out degree" of the specified vertex. An out degree of a vertex in a directed graph is the number of outward directed edges from that vertex. See http://mathworld.wolfram.com/Outdegree.html.- Specified by:
outDegreeOfin interfaceDirectedGraph<V,E>- Parameters:
vertex- vertex whose degree is to be calculated.- Returns:
- the degree of the specified vertex.
-
outgoingEdgesOf
public java.util.Set<E> outgoingEdgesOf(V vertex)
Description copied from interface:DirectedGraphReturns a set of all edges outgoing from the specified vertex.- Specified by:
outgoingEdgesOfin interfaceDirectedGraph<V,E>- Parameters:
vertex- the vertex for which the list of outgoing edges to be returned.- Returns:
- a set of all edges outgoing from the specified vertex.
-
-