blob: bd2b600cf9de0bdfa1e7ef609a21037dfd8c76e2 [file] [log] [blame]
Thomas Vachuska24c849c2014-10-27 09:53:05 -07001/*
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07002 * Copyright 2014 Open Networking Laboratory
Thomas Vachuska24c849c2014-10-27 09:53:05 -07003 *
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07004 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
Thomas Vachuska24c849c2014-10-27 09:53:05 -07007 *
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07008 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
Thomas Vachuska24c849c2014-10-27 09:53:05 -070015 */
tome3489412014-08-29 02:30:38 -070016package org.onlab.graph;
17
18/**
19 * Abstraction of a mutable graph that can be constructed gradually.
20 */
21public interface MutableGraph<V extends Vertex, E extends Edge> extends Graph<V, E> {
22
23 /**
24 * Adds the specified vertex to this graph.
25 *
26 * @param vertex new vertex
27 */
28 void addVertex(V vertex);
29
30 /**
31 * Removes the specified vertex from the graph.
32 *
33 * @param vertex vertex to be removed
34 */
35 void removeVertex(V vertex);
36
37 /**
38 * Adds the specified edge to this graph. If the edge vertexes are not
39 * already in the graph, they will be added as well.
40 *
41 * @param edge new edge
42 */
43 void addEdge(E edge);
44
45 /**
46 * Removes the specified edge from the graph.
47 *
48 * @param edge edge to be removed
49 */
50 void removeEdge(E edge);
51
52 /**
53 * Returns an immutable copy of this graph.
54 *
55 * @return immutable copy
56 */
57 Graph<V, E> toImmutable();
58
59}