001/*
002 * Copyright (C) 2014 The Guava Authors
003 *
004 * Licensed under the Apache License, Version 2.0 (the "License");
005 * you may not use this file except in compliance with the License.
006 * You may obtain a copy of the License at
007 *
008 * http://www.apache.org/licenses/LICENSE-2.0
009 *
010 * Unless required by applicable law or agreed to in writing, software
011 * distributed under the License is distributed on an "AS IS" BASIS,
012 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
013 * See the License for the specific language governing permissions and
014 * limitations under the License.
015 */
016
017package com.google.common.graph;
018
019import com.google.common.annotations.Beta;
020import com.google.errorprone.annotations.CanIgnoreReturnValue;
021
022/**
023 * A subinterface of {@link Graph} which adds mutation methods. When mutation is not required, users
024 * should prefer the {@link Graph} interface.
025 *
026 * @author James Sexton
027 * @author Joshua O'Madadhain
028 * @param <N> Node parameter type
029 * @since 20.0
030 */
031@Beta
032public interface MutableGraph<N> extends Graph<N> {
033
034  /**
035   * Adds {@code node} if it is not already present.
036   *
037   * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null.
038   *
039   * @return {@code true} iff the graph was modified as a result of this call
040   */
041  @CanIgnoreReturnValue
042  boolean addNode(N node);
043
044  /**
045   * Adds an edge connecting {@code nodeU} to {@code nodeV} if one is not already present. In an
046   * undirected graph, the edge will also connect {@code nodeV} to {@code nodeU}.
047   *
048   * <p>Behavior if {@code nodeU} and {@code nodeV} are not already present in this graph is
049   * implementation-dependent. Suggested behaviors include (a) silently {@link #addNode(Object)
050   * adding} {@code nodeU} and {@code nodeV} to the graph (this is the behavior of the default
051   * implementations) or (b) throwing {@code IllegalArgumentException}.
052   *
053   * @return {@code true} iff the graph was modified as a result of this call
054   * @throws IllegalArgumentException if the introduction of the edge would violate {@link
055   *     #allowsSelfLoops()}
056   */
057  @CanIgnoreReturnValue
058  boolean putEdge(N nodeU, N nodeV);
059
060  /**
061   * Removes {@code node} if it is present; all edges incident to {@code node} will also be removed.
062   *
063   * @return {@code true} iff the graph was modified as a result of this call
064   */
065  @CanIgnoreReturnValue
066  boolean removeNode(Object node);
067
068  /**
069   * Removes the edge connecting {@code nodeU} to {@code nodeV}, if it is present.
070   *
071   * @return {@code true} iff the graph was modified as a result of this call
072   */
073  @CanIgnoreReturnValue
074  boolean removeEdge(Object nodeU, Object nodeV);
075}