|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface DirectedGraph<V,E>
A graph whose all edges are directed. This is the root interface of all directed graphs.
See http://mathworld.wolfram.com/DirectedGraph.html for more on directed graphs.
Method Summary | |
---|---|
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. |
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 |
---|
int inDegreeOf(V vertex)
vertex
- vertex whose degree is to be calculated.
java.util.Set<E> incomingEdgesOf(V vertex)
vertex
- the vertex for which the list of incoming edges to be
returned.
int outDegreeOf(V vertex)
vertex
- vertex whose degree is to be calculated.
java.util.Set<E> outgoingEdgesOf(V vertex)
vertex
- the vertex for which the list of outgoing edges to be
returned.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |