- Type Parameters:
- V- the graph vertex type
- All Implemented Interfaces:
- Serializable,- Cloneable,- Graph<V,- com.google.common.graph.EndpointPair<V>> 
ImmutableGraph.
 
 
 The adapter uses class EndpointPair to represent edges. Since the underlying graph is
 immutable, the resulting graph is unmodifiable.
 
See the example below on how to create such an adapter:
 
 
 MutableGraph<String> mutableGraph = GraphBuilder.directed().allowsSelfLoops(true).build();
 
 mutableGraph.addNode("v1");
 mutableGraph.addNode("v2");
 mutableGraph.addEdge("v1", "v2");
 
 ImmutableGraph<String> immutableGraph = ImmutableGraph.copyOf(mutableGraph);
 
 Graph<String, EndpointPair<String>> graph = new ImmutableGraphAdapter<>(immutableGraph);
 
 
 - Author:
- Dimitrios Michail
- See Also:
- 
Field SummaryFieldsFields inherited from class org.jgrapht.graph.guava.BaseGraphAdapteredgeSupplier, graph, LOOPS_NOT_ALLOWED, unmodifiableEdgeSet, unmodifiableVertexSet, vertexOrder, vertexOrderMethod, vertexSupplierFields inherited from interface org.jgrapht.GraphDEFAULT_EDGE_WEIGHT
- 
Constructor SummaryConstructorsConstructorDescriptionImmutableGraphAdapter(com.google.common.graph.ImmutableGraph<V> graph) Create a new adapter.
- 
Method SummaryModifier and TypeMethodDescriptioncom.google.common.graph.EndpointPair<V>Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.booleanAdds the specified edge to this graph, going from the source vertex to the target vertex.Creates a new vertex in this graph and returns it.booleanAdds the specified vertex to this graph if not already present.clone()Returns a shallow copy of this graph instance.getType()Get the graph type.booleanremoveEdge(com.google.common.graph.EndpointPair<V> e) Removes the specified edge from the graph.com.google.common.graph.EndpointPair<V>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.booleanremoveVertex(V v) Removes the specified vertex from this graph including all its touching edges if present.voidsetEdgeWeight(com.google.common.graph.EndpointPair<V> e, double weight) Assigns a weight to an edge.Methods inherited from class org.jgrapht.graph.guava.BaseGraphAdaptercontainsEdge, containsVertex, createVertexOrder, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getVertexSupplier, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, setEdgeSupplier, setVertexSupplier, vertexSetMethods inherited from class org.jgrapht.graph.AbstractGraphassertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsMethods inherited from class java.lang.Objectfinalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface org.jgrapht.GraphcontainsEdge, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getVertexSupplier, incomingEdgesOf, inDegreeOf, iterables, outDegreeOf, outgoingEdgesOf, removeAllEdges, removeAllEdges, removeAllVertices, setEdgeWeight, vertexSet
- 
Field Details- 
GRAPH_IS_IMMUTABLE- See Also:
 
 
- 
- 
Constructor Details- 
ImmutableGraphAdapterCreate a new adapter.- Parameters:
- graph- the graph
 
 
- 
- 
Method Details- 
addEdgeDescription 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.
- 
addEdgeDescription 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.The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown. 
- 
addVertexDescription 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().
- 
addVertexDescription 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.
- 
removeEdgeDescription 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 interface- Graph<V,- com.google.common.graph.EndpointPair<V>> 
- Parameters:
- sourceVertex- source vertex of the edge.
- targetVertex- target vertex of the edge.
- Returns:
- The removed edge, or nullif no edge removed.
 
- 
removeEdgeDescription 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 interface- Graph<V,- com.google.common.graph.EndpointPair<V>> 
- Parameters:
- e- edge to be removed from this graph, if present.
- Returns:
- trueif and only if the graph contained the specified edge.
 
- 
removeVertexDescription 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 interface- Graph<V,- com.google.common.graph.EndpointPair<V>> 
- Parameters:
- v- vertex to be removed from this graph, if present.
- Returns:
- trueif the graph contained the specified vertex;- falseotherwise.
 
- 
setEdgeWeightDescription copied from interface:GraphAssigns a weight to an edge.- Specified by:
- setEdgeWeightin interface- Graph<V,- com.google.common.graph.EndpointPair<V>> 
- Parameters:
- e- edge on which to set weight
- weight- new weight for edge
 
- 
getTypeDescription copied from interface:GraphGet 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.
- 
cloneReturns a shallow copy of this graph instance. Neither edges nor vertices are cloned.- Overrides:
- clonein class- Object
- Returns:
- a shallow copy of this graph.
- Throws:
- RuntimeException- in case the clone is not supported
- See Also:
 
 
-