How to use

BaseGraph

in

com.google.common.graph

@Override
public int size() {
 return graph.adjacentNodes(node).size();
}

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

@Override
public int degree(N node) {
 return delegate().degree(node);
}

@Override
public int size() {
 return graph.inDegree(node)
   + graph.outDegree(node)
   - (graph.successors(node).contains(node) ? 1 : 0);
}

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

private EndpointPairIterator(BaseGraph<N> graph) {
 this.graph = graph;
 this.nodeIterator = graph.nodes().iterator();
}

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

/**
 * Defer to {@link AbstractGraph#edges()} (based on {@link #successors(Object)}) for full edges()
 * implementation.
 */
@Override
protected long edgeCount() {
 return delegate().edges().size();
}

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

@Override
public int outDegree(N node) {
 return delegate().outDegree(node);
}

@Override
public int inDegree(N node) {
 return delegate().inDegree(node);
}

@Override
public int size() {
 return graph.inDegree(node)
   + graph.outDegree(node)
   - (graph.successors(node).contains(node) ? 1 : 0);
}

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

private Undirected(BaseGraph<N> graph) {
 super(graph);
 this.visitedNodes = Sets.newHashSetWithExpectedSize(graph.nodes().size());
}

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

/**
 * Defer to {@link AbstractGraph#edges()} (based on {@link #successors(Object)}) for full edges()
 * implementation.
 */
@Override
protected long edgeCount() {
 return delegate().edges().size();
}

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

@Override
public int outDegree(N node) {
 return delegate().outDegree(node);
}

@Override
public int inDegree(N node) {
 return delegate().inDegree(node);
}

@Override
public int size() {
 return graph.inDegree(node)
   + graph.outDegree(node)
   - (graph.successors(node).contains(node) ? 1 : 0);
}