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

Class MutableNetworkAdapter<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Implemented Interfaces:
    Serializable, Cloneable, Graph<V,​E>
    public class MutableNetworkAdapter<V,​E>
extends BaseNetworkAdapter<V,​E,​com.google.common.graph.MutableNetwork<V,​E>>
implements Graph<V,​E>, Cloneable, Serializable
    A graph adapter class using Guava's MutableNetwork.

    Changes in the adapter such as adding or removing vertices and edges are reflected in the underlying network. Example usage: 

     MutableNetwork<String, DefaultEdge> mutableNetwork =
     NetworkBuilder.directed().allowsParallelEdges(true).allowsSelfLoops(true).build();
 
 Graph<String, DefaultEdge> graph = new MutableNetworkAdapter<>(
     mutableNetwork, SupplierUtil.createStringSupplier(), SupplierUtil.DEFAULT_EDGE_SUPPLIER);
 
 graph.addVertex("v1");
 
 System.out.println(mutableNetwork.nodes().contains("v1")); // outputs true
    Author:
    Dimitrios Michail
    See Also:
    Serialized Form

    • Constructor Detail

      • MutableNetworkAdapter

        public MutableNetworkAdapter​(com.google.common.graph.MutableNetwork<V,​E> network)
        Create a new network adapter.
        Parameters:
        network - the mutable network

      • MutableNetworkAdapter

        public MutableNetworkAdapter​(com.google.common.graph.MutableNetwork<V,​E> network,
                             Supplier<V> vertexSupplier,
                             Supplier<E> edgeSupplier)
        Create a new network adapter.
        Parameters:
        network - the mutable network
        vertexSupplier - the vertex supplier
        edgeSupplier - the edge supplier
        Throws:
        NullPointerException - if network is null

      • MutableNetworkAdapter

        public MutableNetworkAdapter​(com.google.common.graph.MutableNetwork<V,​E> network,
                             Supplier<V> vertexSupplier,
                             Supplier<E> edgeSupplier,
                             ElementOrderMethod<V> vertexOrderMethod)
        Create a new network adapter.
        Parameters:
        network - the mutable network
        vertexSupplier - the vertex supplier
        edgeSupplier - the edge supplier
        vertexOrderMethod - the method used to ensure a total order of the graph vertices. This is required in order to make edge source/targets be consistent.
        Throws:
        IllegalArgumentException - if the supplied vertexOrderMethod cannot be used to create a vertex order
        NullPointerException - if either one of network or vertexOrderMethod is null

    • Method Detail

      • 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.
        Throws:
        IllegalArgumentException - if source or target vertices are not found in the graph or if there is a property of this graph that prevents the addition of the edge
        NullPointerException - if any of the specified vertices is null.
        UnsupportedOperationException - if the graph was not initialized with an edge supplier
        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.
        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.
        Throws:
        IllegalArgumentException - if source or target vertices are not found in the graph or if there is a property of this graph that prevents the addition of the edge
        NullPointerException - if any of the arguments is null
        See Also:
        Graph.addEdge(Object, Object), Graph.getEdgeSupplier()

      • 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.

      • 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
        Throws:
        UnsupportedOperationException - always

      • clone

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