| /* |
| * 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 java.util.Set; |
| |
| /** |
| * A class to allow {@link Network} implementations to be backed by a provided delegate. This is not |
| * currently planned to be released as a general-purpose forwarding class. |
| * |
| * @author James Sexton |
| * @author Joshua O'Madadhain |
| */ |
| abstract class ForwardingNetwork<N, E> extends AbstractNetwork<N, E> { |
| |
| protected abstract Network<N, E> delegate(); |
| |
| @Override |
| public Set<N> nodes() { |
| return delegate().nodes(); |
| } |
| |
| @Override |
| public Set<E> edges() { |
| return delegate().edges(); |
| } |
| |
| @Override |
| public boolean isDirected() { |
| return delegate().isDirected(); |
| } |
| |
| @Override |
| public boolean allowsParallelEdges() { |
| return delegate().allowsParallelEdges(); |
| } |
| |
| @Override |
| public boolean allowsSelfLoops() { |
| return delegate().allowsSelfLoops(); |
| } |
| |
| @Override |
| public ElementOrder<N> nodeOrder() { |
| return delegate().nodeOrder(); |
| } |
| |
| @Override |
| public ElementOrder<E> edgeOrder() { |
| return delegate().edgeOrder(); |
| } |
| |
| @Override |
| public Set<N> adjacentNodes(N node) { |
| return delegate().adjacentNodes(node); |
| } |
| |
| @Override |
| public Set<N> predecessors(N node) { |
| return delegate().predecessors(node); |
| } |
| |
| @Override |
| public Set<N> successors(N node) { |
| return delegate().successors(node); |
| } |
| |
| @Override |
| public Set<E> incidentEdges(N node) { |
| return delegate().incidentEdges(node); |
| } |
| |
| @Override |
| public Set<E> inEdges(N node) { |
| return delegate().inEdges(node); |
| } |
| |
| @Override |
| public Set<E> outEdges(N node) { |
| return delegate().outEdges(node); |
| } |
| |
| @Override |
| public EndpointPair<N> incidentNodes(E edge) { |
| return delegate().incidentNodes(edge); |
| } |
| |
| @Override |
| public Set<E> adjacentEdges(E edge) { |
| return delegate().adjacentEdges(edge); |
| } |
| |
| @Override |
| public int degree(N node) { |
| return delegate().degree(node); |
| } |
| |
| @Override |
| public int inDegree(N node) { |
| return delegate().inDegree(node); |
| } |
| |
| @Override |
| public int outDegree(N node) { |
| return delegate().outDegree(node); |
| } |
| |
| @Override |
| public Set<E> edgesConnecting(N nodeU, N nodeV) { |
| return delegate().edgesConnecting(nodeU, nodeV); |
| } |
| |
| @Override |
| public Set<E> edgesConnecting(EndpointPair<N> endpoints) { |
| return delegate().edgesConnecting(endpoints); |
| } |
| |
| @Override |
| public E edgeConnectingOrNull(N nodeU, N nodeV) { |
| return delegate().edgeConnectingOrNull(nodeU, nodeV); |
| } |
| |
| @Override |
| public E edgeConnectingOrNull(EndpointPair<N> endpoints) { |
| return delegate().edgeConnectingOrNull(endpoints); |
| } |
| |
| @Override |
| public boolean hasEdgeConnecting(N nodeU, N nodeV) { |
| return delegate().hasEdgeConnecting(nodeU, nodeV); |
| } |
| |
| @Override |
| public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { |
| return delegate().hasEdgeConnecting(endpoints); |
| } |
| } |