@Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { return delegate().hasEdgeConnecting(endpoints); } }
@Override public Set<E> edges() { return delegate().edges(); }
@Override public Set<N> successors(N node) { return delegate().successors(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 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 isDirected() { return delegate().isDirected(); }
@Override public boolean allowsSelfLoops() { return delegate().allowsSelfLoops(); }
@Override public ElementOrder<N> nodeOrder() { return delegate().nodeOrder(); }
@Override public Set<E> adjacentEdges(E edge) { return delegate().adjacentEdges(edge); }
@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 boolean hasEdgeConnecting(N nodeU, N nodeV) { return delegate().hasEdgeConnecting(nodeU, nodeV); }
@Override public ElementOrder<E> edgeOrder() { return delegate().edgeOrder(); }
@Override public Set<N> predecessors(N node) { return delegate().predecessors(node); }
@Override public Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); }
@Override public int inDegree(N node) { return delegate().inDegree(node); }
@Override public Optional<E> edgeConnecting(EndpointPair<N> endpoints) { return delegate().edgeConnecting(endpoints); }
@Override public int degree(N node) { return delegate().degree(node); }