Module org.jgrapht.guava
Package org.jgrapht.graph.guava

Class ImmutableNetworkAdapter<V,​E>

java.lang.Object
org.jgrapht.graph.AbstractGraph<V,​E>
org.jgrapht.graph.guava.BaseNetworkAdapter<V,​E,​com.google.common.graph.ImmutableNetwork<V,​E>>
org.jgrapht.graph.guava.ImmutableNetworkAdapter<V,​E>
Type Parameters:
V - the graph vertex type
E - the graph edge type
All Implemented Interfaces:
java.io.Serializable, java.lang.Cloneable, Graph<V,​E>
public class ImmutableNetworkAdapter<V,​E>
extends BaseNetworkAdapter<V,​E,​com.google.common.graph.ImmutableNetwork<V,​E>>
implements Graph<V,​E>, java.lang.Cloneable, java.io.Serializable
A graph adapter class using Guava's ImmutableNetwork.

Since the underlying network is immutable, the resulting graph is unmodifiable.

Example usage: 

 MutableNetwork<String, DefaultEdge> mutableNetwork =
     NetworkBuilder.directed().allowsParallelEdges(true).allowsSelfLoops(true).build();
 
 mutableNetwork.addNode("v1");
 
 ImmutableNetworkGraph<String, DefaultEdge> immutableNetwork =
     ImmutableNetwork.copyOf(mutableNetwork);
 
 Graph<String, DefaultEdge> graph = new ImmutableNetworkAdapter<>(immutableNetwork);
Author:
Dimitrios Michail
See Also:
Serialized Form

  • Field Details

  • Constructor Details

    • ImmutableNetworkAdapter

      public ImmutableNetworkAdapter​(com.google.common.graph.ImmutableNetwork<V,​E> network)
      Create a new network adapter.
      Parameters:
      network - the immutable network

  • Method Details

    • addEdge

      public E addEdge​(V sourceVertex, V targetVertex)
      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, then this method does not change the graph and returns null.

      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's edge supplier (see Graph.getEdgeSupplier()). For the new edge to be added e 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 edge e2 such that e2.equals(e). If such e2 is found then the newly created edge e is abandoned, the method leaves this graph unchanged and returns null.

      If the underlying graph implementation's Graph.getEdgeSupplier() returns null, then this method cannot create edges and throws an UnsupportedOperationException.

      Specified by:
      addEdge in interface Graph<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.
      See Also:
      Graph.getEdgeSupplier()

    • addEdge

      public boolean addEdge​(V sourceVertex, V targetVertex, E e)
      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 edge e2 such that e2.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, then this method does not change the graph and returns false. If the edge was added to the graph, returns true.

      The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown.

      Specified by:
      addEdge in interface Graph<V,​E>
      Parameters:
      sourceVertex - source vertex of the edge.
      targetVertex - target vertex of the edge.
      e - edge to be added to this graph.
      Returns:
      true if this graph did not already contain the specified edge.
      See Also:
      Graph.addEdge(Object, Object), Graph.getEdgeSupplier()

    • addVertex

      public V addVertex()
      Description copied from interface: Graph
      Creates a new vertex in this graph and returns it.

      This method creates the new vertex v using this graph's vertex supplier (see Graph.getVertexSupplier()). For the new vertex to be added v must not be equal to any other vertex in the graph. More formally, the graph must not contain any vertex v2 such that v2.equals(v). If such v2 is found then the newly created vertex v is abandoned, the method leaves this graph unchanged and throws an IllegalArgumentException.

      If the underlying graph implementation's Graph.getVertexSupplier() returns null, then this method cannot create vertices and throws an UnsupportedOperationException.

      Care must also be taken when interchanging calls to methods Graph.addVertex(Object) and Graph.addVertex(). In such a case the user must make sure never to add vertices in the graph using method Graph.addVertex(Object), which are going to be returned in the future by the supplied vertex supplier. Such a sequence will result into an IllegalArgumentException when calling method Graph.addVertex().

      Specified by:
      addVertex in interface Graph<V,​E>
      Returns:
      The newly created vertex if added to the graph.
      See Also:
      Graph.getVertexSupplier()

    • addVertex

      public boolean addVertex​(V v)
      Description copied from interface: Graph
      Adds 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 vertex u such that u.equals(v). If this graph already contains such vertex, the call leaves this graph unchanged and returns false. In combination with the restriction on constructors, this ensures that graphs never contain duplicate vertices.
      Specified by:
      addVertex in interface Graph<V,​E>
      Parameters:
      v - vertex to be added to this graph.
      Returns:
      true if this graph did not already contain the specified vertex.

    • removeEdge

      public E removeEdge​(V sourceVertex, V targetVertex)
      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 or null otherwise.
      Specified by:
      removeEdge in interface Graph<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.

    • removeEdge

      public boolean removeEdge​(E e)
      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 edge e2 such that e2.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 returns false.

      Specified by:
      removeEdge in interface Graph<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.

    • removeVertex

      public boolean removeVertex​(V v)
      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 vertex u such that u.equals(v), the call removes all edges that touch u and then removes u itself. If no such u 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 returns false.

      Specified by:
      removeVertex in interface Graph<V,​E>
      Parameters:
      v - vertex to be removed from this graph, if present.
      Returns:
      true if the graph contained the specified vertex; false otherwise.

    • getEdgeWeight

      public double getEdgeWeight​(E e)
      Description copied from interface: Graph
      Returns the weight assigned to a given edge. Unweighted graphs return 1.0 (as defined by Graph.DEFAULT_EDGE_WEIGHT), allowing weighted-graph algorithms to apply to them when meaningful.
      Specified by:
      getEdgeWeight in interface Graph<V,​E>
      Overrides:
      getEdgeWeight in class BaseNetworkAdapter<V,​E,​com.google.common.graph.ImmutableNetwork<V,​E>>
      Parameters:
      e - edge of interest
      Returns:
      edge weight

    • setEdgeWeight

      public void setEdgeWeight​(E e, double weight)
      Description copied from interface: Graph
      Assigns a weight to an edge.
      Specified by:
      setEdgeWeight in interface Graph<V,​E>
      Parameters:
      e - edge on which to set weight
      weight - new weight for edge

    • getType

      public GraphType getType()
      Description copied from interface: Graph
      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.
      Specified by:
      getType in interface Graph<V,​E>
      Overrides:
      getType in class BaseNetworkAdapter<V,​E,​com.google.common.graph.ImmutableNetwork<V,​E>>
      Returns:
      the graph type

    • clone

      public java.lang.Object clone()
      Returns a shallow copy of this graph instance. Neither edges nor vertices are cloned.
      Overrides:
      clone in class java.lang.Object
      Returns:
      a shallow copy of this graph.
      Throws:
      java.lang.RuntimeException - in case the clone is not supported
      See Also:
      Object.clone()