|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg._3pq.jgrapht.graph.AbstractGraph
org._3pq.jgrapht.graph.Subgraph
org._3pq.jgrapht.graph.DirectedSubgraph
org._3pq.jgrapht.graph.DirectedWeightedSubgraph
A directed weighted graph that is a subgraph on other graph.
Subgraph
,
Serialized FormConstructor Summary | |
DirectedWeightedSubgraph(WeightedGraph base,
java.util.Set vertexSubset,
java.util.Set edgeSubset)
Creates a new weighted directed subgraph. |
Methods inherited from class org._3pq.jgrapht.graph.Subgraph |
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, incomingEdgesOf, inDegreeOf, isVerifyIntegrity, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setVerifyIntegrity, vertexSet |
Methods inherited from class org._3pq.jgrapht.graph.AbstractGraph |
addAllEdges, addAllVertices, 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._3pq.jgrapht.Graph |
addAllEdges, addAllVertices, addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
Methods inherited from interface org._3pq.jgrapht.DirectedGraph |
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf |
Constructor Detail |
public DirectedWeightedSubgraph(WeightedGraph base, java.util.Set vertexSubset, java.util.Set edgeSubset)
base
- the base (backing) graph on which the subgraph will be
based.vertexSubset
- vertices to include in the subgraph. If
null
then all vertices are included.edgeSubset
- edges to in include in the subgraph. If
null
then all the edges whose vertices found in the
graph are included.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |