com.google.common.graph.UndirectedGraphConnections Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of guava Show documentation
Show all versions of guava Show documentation
Guava is a suite of core and expanded libraries that include
utility classes, google's collections, io classes, and much
much more.
/*
* Copyright (C) 2016 The Guava Authors
*
* 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 com.google.common.graph;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.graph.GraphConstants.INNER_CAPACITY;
import static com.google.common.graph.GraphConstants.INNER_LOAD_FACTOR;
import com.google.common.collect.ImmutableMap;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
/**
* An implementation of {@link GraphConnections} for undirected graphs.
*
* @author James Sexton
* @param Node parameter type
* @param Value parameter type
*/
final class UndirectedGraphConnections implements GraphConnections {
private final Map adjacentNodeValues;
private UndirectedGraphConnections(Map adjacentNodeValues) {
this.adjacentNodeValues = checkNotNull(adjacentNodeValues);
}
static UndirectedGraphConnections of() {
return new UndirectedGraphConnections<>(new HashMap(INNER_CAPACITY, INNER_LOAD_FACTOR));
}
static UndirectedGraphConnections ofImmutable(Map adjacentNodeValues) {
return new UndirectedGraphConnections<>(ImmutableMap.copyOf(adjacentNodeValues));
}
@Override
public Set adjacentNodes() {
return Collections.unmodifiableSet(adjacentNodeValues.keySet());
}
@Override
public Set predecessors() {
return adjacentNodes();
}
@Override
public Set successors() {
return adjacentNodes();
}
@Override
public V value(N node) {
return adjacentNodeValues.get(node);
}
@Override
public void removePredecessor(N node) {
@SuppressWarnings("unused")
V unused = removeSuccessor(node);
}
@Override
public V removeSuccessor(N node) {
return adjacentNodeValues.remove(node);
}
@Override
public void addPredecessor(N node, V value) {
@SuppressWarnings("unused")
V unused = addSuccessor(node, value);
}
@Override
public V addSuccessor(N node, V value) {
return adjacentNodeValues.put(node, value);
}
}