Class Subgraph<V,E,G extends Graph<V,E>>
- All Implemented Interfaces:
Serializable
,Graph<V,
E>
- Direct Known Subclasses:
DirectedSubgraph
,UndirectedSubgraph
Graph
interface.
If the base graph is a ListenableGraph
, the subgraph
listens on the base graph and guarantees the subgraph property. If an edge or
a vertex is removed from the base graph, it is automatically removed from the
subgraph. Subgraph listeners are informed on such removal only if it results
in a cascaded removal from the subgraph. If the subgraph has been created as
an induced subgraph it also keeps track of edges being added to its vertices.
If vertices are added to the base graph, the subgraph remains unaffected.
If the base graph is not a ListenableGraph, then the subgraph property cannot be guaranteed. If edges or vertices are removed from the base graph, they are not removed from the subgraph.
Modifications to Subgraph are allowed as long as the subgraph property is maintained. Addition of vertices or edges are allowed as long as they also exist in the base graph. Removal of vertices or edges is always allowed. The base graph is never affected by any modification made to the subgraph.
A subgraph may provide a "live-window" on a base graph, so that changes
made to its vertices or edges are immediately reflected in the base graph,
and vice versa. For that to happen, vertices and edges added to the subgraph
must be identical (that is, reference-equal and not only value-equal)
to their respective ones in the base graph. Previous versions of this class
enforced such identity, at a severe performance cost. Currently it is no
longer enforced. If you want to achieve a "live-window"functionality, your
safest tactics would be to NOT override the equals()
methods of
your vertices and edges. If you use a class that has already overridden the
equals()
method, such as String
, than you can use a
wrapper around it, or else use it directly but exercise a great care to avoid
having different-but-equal instances in the subgraph and the base graph.
This graph implementation guarantees deterministic vertex and edge set
ordering (via LinkedHashSet
).
- Since:
- Jul 18, 2003
- Author:
- Barak Naveh
- See Also:
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionCreates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.boolean
Adds the specified edge to this graph, going from the source vertex to the target vertex.boolean
Adds the specified vertex to this subgraph.boolean
containsEdge
(E e) Returns true if this graph contains the specified edge.boolean
containsVertex
(V v) Returns true if this graph contains the specified vertex.edgeSet()
Returns a set of the edges contained in this graph.Returns a set of all edges touching the specified vertex.getAllEdges
(V sourceVertex, V targetVertex) Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.getBase()
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.Returns the edge factory using which this graph creates new edges.getEdgeSource
(E e) Returns the source vertex of an edge.getEdgeTarget
(E e) Returns the target vertex of an edge.double
getEdgeWeight
(E e) Returns the weight assigned to a given edge.boolean
removeEdge
(E e) Removes the specified edge from the graph.removeEdge
(V sourceVertex, V targetVertex) Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.boolean
removeVertex
(V v) Removes the specified vertex from this graph including all its touching edges if present.void
setEdgeWeight
(E e, double weight) Returns a set of the vertices contained in this graph.Methods inherited from class org.jgrapht.graph.AbstractGraph
assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets
-
Constructor Details
-
Subgraph
Creates a new Subgraph.- Parameters:
base
- the base (backing) graph on which the subgraph will be based.vertexSubset
- vertices to include in the subgraph. Ifnull
then all vertices are included.edgeSubset
- edges to in include in the subgraph. Ifnull
then all the edges whose vertices found in the graph are included.
-
Subgraph
Creates a new induced Subgraph. The subgraph will keep track of edges being added to its vertex subset as well as deletion of edges and vertices. If base it not listenable, this is identical to the call Subgraph(base, vertexSubset, null) .- Parameters:
base
- the base (backing) graph on which the subgraph will be based.vertexSubset
- vertices to include in the subgraph. Ifnull
then all vertices are included.
-
-
Method Details
-
getAllEdges
Description copied from interface:Graph
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph. If any of the vertices does not exist or isnull
, returnsnull
. If both vertices exist but no edges found, returns an empty set.In undirected graphs, some of the returned edges may have their source and target vertices in the opposite order. In simple graphs the returned set is either singleton set or empty set.
- Specified by:
getAllEdges
in interfaceGraph<V,
E> - Parameters:
sourceVertex
- source vertex of the edge.targetVertex
- target vertex of the edge.- Returns:
- a set of all edges connecting source vertex to target vertex.
- See Also:
-
getEdge
Description copied from interface:Graph
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph. Otherwise returnsnull
. If any of the specified vertices isnull
returnsnull
In undirected graphs, the returned edge may have its source and target vertices in the opposite order.
-
getEdgeFactory
Description copied from interface:Graph
Returns the edge factory using which this graph creates new edges. The edge factory is defined when the graph is constructed and must not be modified.- Specified by:
getEdgeFactory
in interfaceGraph<V,
E> - Returns:
- the edge factory using which this graph creates new edges.
- See Also:
-
addEdge
Description copied from interface:Graph
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge. Some graphs do not allow edge-multiplicity. In such cases, if the graph already contains an edge from the specified source to the specified target, than this method does not change the graph and returnsnull
.The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown.
This method creates the new edge
e
using this graph'sEdgeFactory
. For the new edge to be addede
must not be equal to any other edge the graph (even if the graph allows edge-multiplicity). More formally, the graph must not contain any edgee2
such thate2.equals(e)
. If suche2
is found then the newly created edgee
is abandoned, the method leaves this graph unchanged returnsnull
. -
addEdge
Description copied from interface:Graph
Adds the specified edge to this graph, going from the source vertex to the target vertex. More formally, adds the specified edge,e
, to this graph if this graph contains no edgee2
such thate2.equals(e)
. If this graph already contains such an edge, the call leaves this graph unchanged and returns false. Some graphs do not allow edge-multiplicity. In such cases, if the graph already contains an edge from the specified source to the specified target, than this method does not change the graph and returnsfalse
. If the edge was added to the graph, returnstrue
.The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown.
-
addVertex
Adds the specified vertex to this subgraph.- Specified by:
addVertex
in interfaceGraph<V,
E> - Parameters:
v
- the vertex to be added.- Returns:
true
if the vertex was added, otherwisefalse
.- Throws:
NullPointerException
IllegalArgumentException
- See Also:
-
containsEdge
Description copied from interface:Graph
Returns true if this graph contains the specified edge. More formally, returns true if and only if this graph contains an edgee2
such thate.equals(e2)
. If the specified edge isnull
returnsfalse
.- Specified by:
containsEdge
in interfaceGraph<V,
E> - Parameters:
e
- edge whose presence in this graph is to be tested.- Returns:
- true if this graph contains the specified edge.
- See Also:
-
containsVertex
Description copied from interface:Graph
Returns true if this graph contains the specified vertex. More formally, returns true if and only if this graph contains a vertexu
such thatu.equals(v)
. If the specified vertex isnull
returnsfalse
.- Specified by:
containsVertex
in interfaceGraph<V,
E> - Parameters:
v
- vertex whose presence in this graph is to be tested.- Returns:
- true if this graph contains the specified vertex.
- See Also:
-
edgeSet
Description copied from interface:Graph
Returns a set of the edges contained in this graph. The set is backed by the graph, so changes to the graph are reflected in the set. If the graph is modified while an iteration over the set is in progress, the results of the iteration are undefined.The graph implementation may maintain a particular set ordering (e.g. via
LinkedHashSet
) for deterministic iteration, but this is not required. It is the responsibility of callers who rely on this behavior to only use graph implementations which support it. -
edgesOf
Description copied from interface:Graph
Returns a set of all edges touching the specified vertex. If no edges are touching the specified vertex returns an empty set. -
removeEdge
Description copied from interface:Graph
Removes the specified edge from the graph. Removes the specified edge from this graph if it is present. More formally, removes an edgee2
such thate2.equals(e)
, if the graph contains such edge. Returns true if the graph contained the specified edge. (The graph will not contain the specified edge once the call returns).If the specified edge is
null
returnsfalse
.- Specified by:
removeEdge
in interfaceGraph<V,
E> - Parameters:
e
- edge to be removed from this graph, if present.- Returns:
true
if and only if the graph contained the specified edge.- See Also:
-
removeEdge
Description copied from interface:Graph
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph. Returns the edge if removed ornull
otherwise.- Specified by:
removeEdge
in interfaceGraph<V,
E> - Parameters:
sourceVertex
- source vertex of the edge.targetVertex
- target vertex of the edge.- Returns:
- The removed edge, or
null
if no edge removed. - See Also:
-
removeVertex
Description copied from interface:Graph
Removes the specified vertex from this graph including all its touching edges if present. More formally, if the graph contains a vertexu
such thatu.equals(v)
, the call removes all edges that touchu
and then removesu
itself. If no suchu
is found, the call leaves the graph unchanged. Returns true if the graph contained the specified vertex. (The graph will not contain the specified vertex once the call returns).If the specified vertex is
null
returnsfalse
.- Specified by:
removeVertex
in interfaceGraph<V,
E> - Parameters:
v
- vertex to be removed from this graph, if present.- Returns:
true
if the graph contained the specified vertex;false
otherwise.- See Also:
-
vertexSet
Description copied from interface:Graph
Returns a set of the vertices contained in this graph. The set is backed by the graph, so changes to the graph are reflected in the set. If the graph is modified while an iteration over the set is in progress, the results of the iteration are undefined.The graph implementation may maintain a particular set ordering (e.g. via
LinkedHashSet
) for deterministic iteration, but this is not required. It is the responsibility of callers who rely on this behavior to only use graph implementations which support it. -
getEdgeSource
Description copied from interface:Graph
Returns the source vertex of an edge. For an undirected graph, source and target are distinguishable designations (but without any mathematical meaning).- Specified by:
getEdgeSource
in interfaceGraph<V,
E> - Parameters:
e
- edge of interest- Returns:
- source vertex
- See Also:
-
getEdgeTarget
Description copied from interface:Graph
Returns the target vertex of an edge. For an undirected graph, source and target are distinguishable designations (but without any mathematical meaning).- Specified by:
getEdgeTarget
in interfaceGraph<V,
E> - Parameters:
e
- edge of interest- Returns:
- target vertex
- See Also:
-
getBase
-
getEdgeWeight
Description copied from interface:Graph
Returns the weight assigned to a given edge. Unweighted graphs return 1.0 (as defined byWeightedGraph.DEFAULT_EDGE_WEIGHT
), allowing weighted-graph algorithms to apply to them where meaningful.- Specified by:
getEdgeWeight
in interfaceGraph<V,
E> - Parameters:
e
- edge of interest- Returns:
- edge weight
- See Also:
-
setEdgeWeight
- See Also:
-