- java.lang.Object
-
- org.jgrapht.graph.AbstractGraph<V,E>
-
- org.jgrapht.graph.GraphDelegator<V,E>
-
- org.jgrapht.graph.AsUnmodifiableGraph<V,E>
-
- Type Parameters:
V- the graph vertex typeE- the graph edge type
- All Implemented Interfaces:
Serializable,Graph<V,E>
public class AsUnmodifiableGraph<V,E> extends GraphDelegator<V,E> implements Serializable
An unmodifiable view of the backing graph specified in the constructor. This graph allows modules to provide users with "read-only" access to internal graphs. Query operations on this graph "read through" to the backing graph, and attempts to modify this graph result in anUnsupportedOperationException.This graph does not pass the hashCode and equals operations through to the backing graph, but relies on
Object'sequalsandhashCodemethods. This graph will be serializable if the backing graph is serializable.- Author:
- Barak Naveh
- See Also:
- Serialized Form
-
-
Field Summary
-
Fields inherited from interface org.jgrapht.Graph
DEFAULT_EDGE_WEIGHT
-
-
Constructor Summary
Constructors Constructor Description AsUnmodifiableGraph(Graph<V,E> g)Creates a new unmodifiable graph based on the specified backing graph.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description EaddEdge(V sourceVertex, V targetVertex)Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.booleanaddEdge(V sourceVertex, V targetVertex, E e)Adds the specified edge to this graph, going from the source vertex to the target vertex.VaddVertex()Creates a new vertex in this graph and returns it.booleanaddVertex(V v)Adds the specified vertex to this graph if not already present.GraphTypegetType()Get the graph type.booleanremoveAllEdges(Collection<? extends E> edges)Removes all the edges in this graph that are also contained in the specified edge collection.Set<E>removeAllEdges(V sourceVertex, V targetVertex)Removes all the edges going from the specified source vertex to the specified target vertex, and returns a set of all removed edges.booleanremoveAllVertices(Collection<? extends V> vertices)Removes all the vertices in this graph that are also contained in the specified vertex collection.booleanremoveEdge(E e)Removes the specified edge from the graph.EremoveEdge(V sourceVertex, V targetVertex)Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.booleanremoveVertex(V v)Removes the specified vertex from this graph including all its touching edges if present.voidsetEdgeWeight(E e, double weight)Assigns a weight to an edge.voidsetEdgeWeight(V sourceVertex, V targetVertex, double weight)Assigns a weight to an edge betweensourceVertexandtargetVertex.-
Methods inherited from class org.jgrapht.graph.GraphDelegator
containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getDelegate, getEdge, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getVertexSupplier, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, toString, vertexSet
-
Methods inherited from class org.jgrapht.graph.AbstractGraph
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, toStringFromSets
-
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface org.jgrapht.Graph
containsEdge, iterables
-
-
-
-
Constructor Detail
-
AsUnmodifiableGraph
public AsUnmodifiableGraph(Graph<V,E> g)
Creates a new unmodifiable graph based on the specified backing graph.- Parameters:
g- the backing graph on which an unmodifiable graph is to be created- Throws:
NullPointerException- if argument isnull
-
-
Method Detail
-
addEdge
public E addEdge(V sourceVertex, V targetVertex)
Description copied from interface:GraphCreates 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, then 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
IllegalArgumentExceptionis thrown.This method creates the new edge
eusing this graph's edge supplier (seeGraph.getEdgeSupplier()). For the new edge to be addedemust not be equal to any other edge the graph (even if the graph allows edge-multiplicity). More formally, the graph must not contain any edgee2such thate2.equals(e). If suche2is found then the newly created edgeeis abandoned, the method leaves this graph unchanged and returnsnull.If the underlying graph implementation's
Graph.getEdgeSupplier()returnsnull, then this method cannot create edges and throws anUnsupportedOperationException.- Specified by:
addEdgein interfaceGraph<V,E>- Overrides:
addEdgein classGraphDelegator<V,E>- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.- Returns:
- The newly created edge if added to the graph, otherwise
null. - Throws:
UnsupportedOperationException- always- See Also:
Graph.getEdgeSupplier()
-
addEdge
public boolean addEdge(V sourceVertex, V targetVertex, E e)
Description copied from interface:GraphAdds 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 edgee2such thate2.equals(e). If this graph already contains such an edge, the call leaves this graph unchanged and returnsfalse. 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, then this method does not change the graph and returnsfalse. If the edge was added to the graph, returnstrue.- Specified by:
addEdgein interfaceGraph<V,E>- Overrides:
addEdgein classGraphDelegator<V,E>- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.e- edge to be added to this graph.- Returns:
trueif this graph did not already contain the specified edge.- Throws:
UnsupportedOperationException- always- See Also:
Graph.addEdge(Object, Object),Graph.getEdgeSupplier()
-
addVertex
public V addVertex()
Description copied from interface:GraphCreates a new vertex in this graph and returns it.This method creates the new vertex
vusing this graph's vertex supplier (seeGraph.getVertexSupplier()). For the new vertex to be addedvmust not be equal to any other vertex in the graph. More formally, the graph must not contain any vertexv2such thatv2.equals(v). If suchv2is found then the newly created vertexvis abandoned, the method leaves this graph unchanged and throws anIllegalArgumentException.If the underlying graph implementation's
Graph.getVertexSupplier()returnsnull, then this method cannot create vertices and throws anUnsupportedOperationException.Care must also be taken when interchanging calls to methods
Graph.addVertex(Object)andGraph.addVertex(). In such a case the user must make sure never to add vertices in the graph using methodGraph.addVertex(Object), which are going to be returned in the future by the supplied vertex supplier. Such a sequence will result into anIllegalArgumentExceptionwhen calling methodGraph.addVertex().- Specified by:
addVertexin interfaceGraph<V,E>- Overrides:
addVertexin classGraphDelegator<V,E>- Returns:
- The newly created vertex if added to the graph.
- Throws:
UnsupportedOperationException- always- See Also:
Graph.getVertexSupplier()
-
addVertex
public boolean addVertex(V v)
Description copied from interface:GraphAdds the specified vertex to this graph if not already present. More formally, adds the specified vertex,v, to this graph if this graph contains no vertexusuch thatu.equals(v). If this graph already contains such vertex, the call leaves this graph unchanged and returnsfalse. In combination with the restriction on constructors, this ensures that graphs never contain duplicate vertices.- Specified by:
addVertexin interfaceGraph<V,E>- Overrides:
addVertexin classGraphDelegator<V,E>- Parameters:
v- vertex to be added to this graph.- Returns:
trueif this graph did not already contain the specified vertex.- Throws:
UnsupportedOperationException- always
-
removeAllEdges
public boolean removeAllEdges(Collection<? extends E> edges)
Description copied from interface:GraphRemoves all the edges in this graph that are also contained in the specified edge collection. After this call returns, this graph will contain no edges in common with the specified edges. This method will invoke theGraph.removeEdge(Object)method.- Specified by:
removeAllEdgesin interfaceGraph<V,E>- Overrides:
removeAllEdgesin classAbstractGraph<V,E>- Parameters:
edges- edges to be removed from this graph.- Returns:
trueif this graph changed as a result of the call- Throws:
UnsupportedOperationException- always- See Also:
Graph.removeEdge(Object),Graph.containsEdge(Object)
-
removeAllEdges
public Set<E> removeAllEdges(V sourceVertex, V targetVertex)
Description copied from interface:GraphRemoves all the edges going from the specified source vertex to the specified target vertex, and returns a set of all removed edges. Returnsnullif any of the specified vertices does not exist in the graph. If both vertices exist but no edge is found, returns an empty set. This method will either invoke theGraph.removeEdge(Object)method, or theGraph.removeEdge(Object, Object)method.- Specified by:
removeAllEdgesin interfaceGraph<V,E>- Overrides:
removeAllEdgesin classAbstractGraph<V,E>- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.- Returns:
- the removed edges, or
nullif either vertex is not part of graph - Throws:
UnsupportedOperationException- always
-
removeAllVertices
public boolean removeAllVertices(Collection<? extends V> vertices)
Description copied from interface:GraphRemoves all the vertices in this graph that are also contained in the specified vertex collection. After this call returns, this graph will contain no vertices in common with the specified vertices. This method will invoke theGraph.removeVertex(Object)method.- Specified by:
removeAllVerticesin interfaceGraph<V,E>- Overrides:
removeAllVerticesin classAbstractGraph<V,E>- Parameters:
vertices- vertices to be removed from this graph.- Returns:
trueif this graph changed as a result of the call- Throws:
UnsupportedOperationException- always- See Also:
Graph.removeVertex(Object),Graph.containsVertex(Object)
-
removeEdge
public boolean removeEdge(E e)
Description copied from interface:GraphRemoves the specified edge from the graph. Removes the specified edge from this graph if it is present. More formally, removes an edgee2such thate2.equals(e), if the graph contains such edge. Returnstrueif the graph contained the specified edge. (The graph will not contain the specified edge once the call returns).If the specified edge is
nullreturnsfalse.- Specified by:
removeEdgein interfaceGraph<V,E>- Overrides:
removeEdgein classGraphDelegator<V,E>- Parameters:
e- edge to be removed from this graph, if present.- Returns:
trueif and only if the graph contained the specified edge.- Throws:
UnsupportedOperationException- always
-
removeEdge
public E removeEdge(V sourceVertex, V targetVertex)
Description copied from interface:GraphRemoves an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph. Returns the edge if removed ornullotherwise.- Specified by:
removeEdgein interfaceGraph<V,E>- Overrides:
removeEdgein classGraphDelegator<V,E>- Parameters:
sourceVertex- source vertex of the edge.targetVertex- target vertex of the edge.- Returns:
- The removed edge, or
nullif no edge removed. - Throws:
UnsupportedOperationException- always
-
removeVertex
public boolean removeVertex(V v)
Description copied from interface:GraphRemoves the specified vertex from this graph including all its touching edges if present. More formally, if the graph contains a vertexusuch thatu.equals(v), the call removes all edges that touchuand then removesuitself. If no suchuis found, the call leaves the graph unchanged. Returnstrueif the graph contained the specified vertex. (The graph will not contain the specified vertex once the call returns).If the specified vertex is
nullreturnsfalse.- Specified by:
removeVertexin interfaceGraph<V,E>- Overrides:
removeVertexin classGraphDelegator<V,E>- Parameters:
v- vertex to be removed from this graph, if present.- Returns:
trueif the graph contained the specified vertex;falseotherwise.- Throws:
UnsupportedOperationException- always
-
getType
public GraphType getType()
Get the graph type. The graph type can be used to query for additional metadata such as whether the graph supports directed or undirected edges, self-loops, multiple (parallel) edges, weights, etc.
-
setEdgeWeight
public void setEdgeWeight(E e, double weight)
Description copied from interface:GraphAssigns a weight to an edge.- Specified by:
setEdgeWeightin interfaceGraph<V,E>- Overrides:
setEdgeWeightin classGraphDelegator<V,E>- Parameters:
e- edge on which to set weightweight- new weight for edge- Throws:
UnsupportedOperationException- always- Since:
- 1.5.3
-
setEdgeWeight
public void setEdgeWeight(V sourceVertex, V targetVertex, double weight)
Description copied from interface:GraphAssigns a weight to an edge betweensourceVertexandtargetVertex.When there exist multiple edges between
sourceVertexandtargetVertex, consider usingGraph.setEdgeWeight(Object, double)instead.- Specified by:
setEdgeWeightin interfaceGraph<V,E>- Parameters:
sourceVertex- source vertex of the edgetargetVertex- target vertex of the edgeweight- new weight for edge- Throws:
UnsupportedOperationException- always- Since:
- 1.5.3
-
-