1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
|
/*
* Copyright 2014 Open Networking Laboratory
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.onlab.graph;
import static com.google.common.base.MoreObjects.toStringHelper;
import java.util.HashSet;
import java.util.Objects;
import java.util.Set;
import com.google.common.collect.HashMultimap;
import com.google.common.collect.SetMultimap;
public class MutableAdjacencyListsGraph<V extends Vertex, E extends Edge<V>>
implements MutableGraph<V, E> {
private Set<V> vertexes = new HashSet<V>();
private Set<E> edges = new HashSet<E>();
private SetMultimap<V, E> sources = HashMultimap.create();
private SetMultimap<V, E> destinations = HashMultimap.create();
/**
* Creates a graph comprising of the specified vertexes and edges.
*
* @param vertex set of graph vertexes
* @param edge set of graph edges
*/
public MutableAdjacencyListsGraph(Set<V> vertex, Set<E> edge) {
vertexes.addAll(vertex);
edges.addAll(edge);
for (E e : edge) {
sources.put(e.src(), e);
vertexes.add(e.src());
destinations.put(e.dst(), e);
vertexes.add(e.dst());
}
}
@Override
public Set<V> getVertexes() {
return vertexes;
}
@Override
public Set<E> getEdges() {
return edges;
}
@Override
public Set<E> getEdgesFrom(V src) {
return sources.get(src);
}
@Override
public Set<E> getEdgesTo(V dst) {
return destinations.get(dst);
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj instanceof MutableAdjacencyListsGraph) {
MutableAdjacencyListsGraph that = (MutableAdjacencyListsGraph) obj;
return this.getClass() == that.getClass() &&
Objects.equals(this.vertexes, that.vertexes) &&
Objects.equals(this.edges, that.edges);
}
return false;
}
@Override
public int hashCode() {
return Objects.hash(vertexes, edges);
}
@Override
public String toString() {
return toStringHelper(this)
.add("vertexes", vertexes)
.add("edges", edges)
.toString();
}
@Override
public void addVertex(V vertex) {
if (vertexes != null) {
if (!vertexes.contains(vertex)) {
vertexes.add(vertex);
}
}
}
@Override
public void removeVertex(V vertex) {
if (vertexes != null && edges != null) {
if (vertexes.contains(vertex)) {
vertexes.remove(vertex);
Set<E> srcEdgesList = sources.get(vertex);
Set<E> dstEdgesList = destinations.get(vertex);
edges.removeAll(srcEdgesList);
edges.removeAll(dstEdgesList);
sources.remove(vertex, srcEdgesList);
sources.remove(vertex, dstEdgesList);
}
}
}
@Override
public void addEdge(E edge) {
if (edges != null) {
if (!edges.contains(edge)) {
edges.add(edge);
sources.put(edge.src(), edge);
destinations.put(edge.dst(), edge);
}
}
}
@Override
public void removeEdge(E edge) {
if (edges != null) {
if (edges.contains(edge)) {
edges.remove(edge);
sources.remove(edge.src(), edge);
destinations.remove(edge.dst(), edge);
}
}
}
@Override
public Graph<V, E> toImmutable() {
return null;
}
/**
* Clear the graph.
*/
public void clear() {
edges.clear();
vertexes.clear();
sources.clear();
destinations.clear();
}
}
|
