com.google.common.graph.UndirectedNetworkConnections 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
Builds the guava lib. Requires the jsr305 be built first.
/*
* 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.graph.GraphConstants.EXPECTED_DEGREE;
import com.google.common.collect.BiMap;
import com.google.common.collect.HashBiMap;
import com.google.common.collect.ImmutableBiMap;
import java.util.Collections;
import java.util.Map;
import java.util.Set;
/**
* An implementation of {@link NetworkConnections} for undirected networks.
*
* @author James Sexton
* @param Node parameter type
* @param Edge parameter type
*/
@ElementTypesAreNonnullByDefault
final class UndirectedNetworkConnections extends AbstractUndirectedNetworkConnections {
UndirectedNetworkConnections(Map incidentEdgeMap) {
super(incidentEdgeMap);
}
static UndirectedNetworkConnections of() {
return new UndirectedNetworkConnections<>(HashBiMap.create(EXPECTED_DEGREE));
}
static UndirectedNetworkConnections ofImmutable(Map incidentEdges) {
return new UndirectedNetworkConnections<>(ImmutableBiMap.copyOf(incidentEdges));
}
@Override
public Set adjacentNodes() {
return Collections.unmodifiableSet(((BiMap) incidentEdgeMap).values());
}
@Override
public Set edgesConnecting(N node) {
return new EdgesConnecting<>(((BiMap) incidentEdgeMap).inverse(), node);
}
}