V
 the graph vertex typeE
 the graph edge typepublic class DirectedMaskSubgraph<V,E> extends MaskSubgraph<V,E> implements DirectedGraph<V,E>
MaskSubgraph
of another graph.base, edgeMask, edges, vertexMask, vertices
Constructor and Description 

DirectedMaskSubgraph(DirectedGraph<V,E> base,
MaskFunctor<V,E> mask)
Deprecated.
in favor of using lambdas

DirectedMaskSubgraph(DirectedGraph<V,E> base,
java.util.function.Predicate<V> vertexMask,
java.util.function.Predicate<E> edgeMask)
Create a new directed
MaskSubgraph of another graph. 
Modifier and Type  Method and Description 

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.

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, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toString, toStringFromSets
clone, finalize, getClass, 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
@Deprecated public DirectedMaskSubgraph(DirectedGraph<V,E> base, MaskFunctor<V,E> mask)
MaskSubgraph
of another graph.base
 the base graphmask
 vertices and edges to exclude in the subgraph. If a vertex/edge is masked, it is
as if it is not in the subgraph.public DirectedMaskSubgraph(DirectedGraph<V,E> base, java.util.function.Predicate<V> vertexMask, java.util.function.Predicate<E> edgeMask)
MaskSubgraph
of another graph.base
 the base graphvertexMask
 vertices to exclude in the subgraph. If a vertex is masked, it is as if it
is not in the subgraph. Edges incident to the masked vertex are also masked.edgeMask
 edges to exclude in the subgraph. If an edge is masked, it is as if it is not
in the subgraph.public int inDegreeOf(V vertex)
inDegreeOf
in interface DirectedGraph<V,E>
vertex
 vertex whose degree is to be calculated.public Set<E> incomingEdgesOf(V vertex)
incomingEdgesOf
in interface DirectedGraph<V,E>
vertex
 the vertex for which the list of incoming edges to be returned.public int outDegreeOf(V vertex)
outDegreeOf
in interface DirectedGraph<V,E>
vertex
 vertex whose degree is to be calculated.public Set<E> outgoingEdgesOf(V vertex)
outgoingEdgesOf
in interface DirectedGraph<V,E>
vertex
 the vertex for which the list of outgoing edges to be returned.Copyright © 2017. All rights reserved.