Interface MutableGraph<N>

    • Method Detail

      • addNode

        boolean addNode​(N node)
        Adds node if it is not already present.

        Nodes must be unique, just as Map keys must be. They must also be non-null.

        Returns:
        true if the graph was modified as a result of this call
      • putEdge

        boolean putEdge​(N nodeU,
                        N nodeV)
        Adds an edge connecting nodeU to nodeV if one is not already present. In an undirected graph, the edge will also connect nodeV to nodeU.

        If nodeU and nodeV are not already present in this graph, this method will silently add nodeU and nodeV to the graph.

        Returns:
        true if the graph was modified as a result of this call
        Throws:
        java.lang.IllegalArgumentException - if the introduction of the edge would violate Graph.allowsSelfLoops()
      • removeNode

        boolean removeNode​(N node)
        Removes node if it is present; all edges incident to node will also be removed.
        Returns:
        true if the graph was modified as a result of this call
      • removeEdge

        boolean removeEdge​(N nodeU,
                           N nodeV)
        Removes the edge connecting nodeU to nodeV, if it is present.
        Returns:
        true if the graph was modified as a result of this call