io.github.oliviercailloux.j_voting.graph.ForwardingMutableGraph Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of j-voting Show documentation

General classes for dealing with social choice theory.

The newest version!

package io.github.oliviercailloux.j_voting.graph;

import java.util.Set;

import com.google.common.graph.ElementOrder;
import com.google.common.graph.EndpointPair;
import com.google.common.graph.MutableGraph;

public class ForwardingMutableGraph implements MutableGraph {
	private MutableGraph delegate;

	protected ForwardingMutableGraph(MutableGraph delegate) {
		this.delegate = delegate;
	}

	@Override
	public Set nodes() {
		return delegate.nodes();
	}

	@Override
	public Set> edges() {
		return delegate.edges();
	}

	@Override
	public boolean isDirected() {
		return delegate.isDirected();
	}

	@Override
	public boolean allowsSelfLoops() {
		return delegate.allowsSelfLoops();
	}

	@Override
	public ElementOrder nodeOrder() {
		return delegate.nodeOrder();
	}

	@Override
	public Set adjacentNodes(N node) {
		return delegate.adjacentNodes(node);
	}

	@Override
	public Set predecessors(N node) {
		return delegate.predecessors(node);
	}

	@Override
	public Set successors(N node) {
		return delegate.successors(node);
	}

	@Override
	public Set> incidentEdges(N node) {
		return delegate.incidentEdges(node);
	}

	@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 boolean hasEdgeConnecting(N nodeU, N nodeV) {
		return delegate.hasEdgeConnecting(nodeU, nodeV);
	}

	@Override
	public boolean addNode(N node) {
		return delegate.addNode(node);
	}

	@Override
	public boolean putEdge(N nodeU, N nodeV) {
		return delegate.putEdge(nodeU, nodeV);
	}

	@Override
	public boolean removeNode(N node) {
		return delegate.removeNode(node);
	}

	@Override
	public boolean removeEdge(N nodeU, N nodeV) {
		return delegate.removeEdge(nodeU, nodeV);
	}

	@Override
	public boolean hasEdgeConnecting(EndpointPair endpoints) {
		return delegate.hasEdgeConnecting(endpoints);
	}

	@Override
	public boolean putEdge(EndpointPair endpoints) {
		return delegate.putEdge(endpoints);
	}

	@Override
	public boolean removeEdge(EndpointPair endpoints) {
		return delegate.removeEdge(endpoints);
	}

	@Override
	public ElementOrder incidentEdgeOrder() {
		return delegate.incidentEdgeOrder();
	}

	@Override
	public boolean equals(Object o2) {
		return delegate.equals(o2);
	}

	@Override
	public int hashCode() {
		return delegate.hashCode();
	}
}