/** * Defer to {@link AbstractValueGraph#edges()} (based on {@link #successors(Object)}) for full * edges() implementation. */ @Override protected long edgeCount() { return delegate().edges().size(); }
@Override public int degree(N node) { return delegate().degree(node); }
@Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { return delegate().hasEdgeConnecting(endpoints); }
@Override public Optional<V> edgeValue(N nodeU, N nodeV) { return delegate().edgeValue(nodeU, nodeV); }
@Override public boolean allowsSelfLoops() { return delegate().allowsSelfLoops(); }
@Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); }
@Override public int inDegree(N node) { return delegate().inDegree(node); }
@Override public Optional<V> edgeValue(EndpointPair<N> endpoints) { return delegate().edgeValue(endpoints); }
@Override public boolean isDirected() { return delegate().isDirected(); }
@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 Set<N> nodes() { return delegate().nodes(); }
@Override public ElementOrder<N> nodeOrder() { return delegate().nodeOrder(); }
@Override public Set<N> predecessors(N node) { return delegate().predecessors(node); }
@Override public Set<N> successors(N node) { return delegate().successors(node); }
/** * Defer to {@link AbstractValueGraph#edges()} (based on {@link #successors(Object)}) for full * edges() implementation. */ @Override protected long edgeCount() { return delegate().edges().size(); }
@Override public Set<N> predecessors(N node) { return delegate().predecessors(node); }
@Override public Set<N> successors(N node) { return delegate().successors(node); }
@Override public int inDegree(N node) { return delegate().inDegree(node); }
@Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { return delegate().hasEdgeConnecting(nodeU, nodeV); }