| /* |
| * 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 directed networks. |
| * |
| * @author James Sexton |
| * @param <N> Node parameter type |
| * @param <E> Edge parameter type |
| */ |
| final class DirectedNetworkConnections<N, E> extends AbstractDirectedNetworkConnections<N, E> { |
| |
| protected DirectedNetworkConnections( |
| Map<E, N> inEdgeMap, Map<E, N> outEdgeMap, int selfLoopCount) { |
| super(inEdgeMap, outEdgeMap, selfLoopCount); |
| } |
| |
| static <N, E> DirectedNetworkConnections<N, E> of() { |
| return new DirectedNetworkConnections<>( |
| HashBiMap.<E, N>create(EXPECTED_DEGREE), HashBiMap.<E, N>create(EXPECTED_DEGREE), 0); |
| } |
| |
| static <N, E> DirectedNetworkConnections<N, E> ofImmutable( |
| Map<E, N> inEdges, Map<E, N> outEdges, int selfLoopCount) { |
| return new DirectedNetworkConnections<>( |
| ImmutableBiMap.copyOf(inEdges), ImmutableBiMap.copyOf(outEdges), selfLoopCount); |
| } |
| |
| @Override |
| public Set<N> predecessors() { |
| return Collections.unmodifiableSet(((BiMap<E, N>) inEdgeMap).values()); |
| } |
| |
| @Override |
| public Set<N> successors() { |
| return Collections.unmodifiableSet(((BiMap<E, N>) outEdgeMap).values()); |
| } |
| |
| @Override |
| public Set<E> edgesConnecting(N node) { |
| return new EdgesConnecting<E>(((BiMap<E, N>) outEdgeMap).inverse(), node); |
| } |
| } |