How to use

adjacentNodes

method

in

com.google.common.graph.BaseGraph

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

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

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.transform(
     graph.adjacentNodes(node).iterator(),
     new Function<N, EndpointPair<N>>() {
      @Override
      public EndpointPair<N> apply(N adjacentNode) {
       return EndpointPair.unordered(node, adjacentNode);
      }
     }));
}

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

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

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.transform(
     graph.adjacentNodes(node).iterator(),
     new Function<N, EndpointPair<N>>() {
      @Override
      public EndpointPair<N> apply(N adjacentNode) {
       return EndpointPair.unordered(node, adjacentNode);
      }
     }));
}

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

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.transform(
     graph.adjacentNodes(node).iterator(),
     new Function<N, EndpointPair<N>>() {
      @Override
      public EndpointPair<N> apply(N adjacentNode) {
       return EndpointPair.unordered(node, adjacentNode);
      }
     }));
}

 @Override
 public boolean contains(@Nullable Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (endpointPair.isOrdered()) {
   return false;
  }
  Set<N> adjacent = graph.adjacentNodes(node);
  Object nodeU = endpointPair.nodeU();
  Object nodeV = endpointPair.nodeV();
  return (node.equals(nodeV) && adjacent.contains(nodeU))
    || (node.equals(nodeU) && adjacent.contains(nodeV));
 }
}

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

 @Override
 public boolean contains(@NullableDecl Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (endpointPair.isOrdered()) {
   return false;
  }
  Set<N> adjacent = graph.adjacentNodes(node);
  Object nodeU = endpointPair.nodeU();
  Object nodeV = endpointPair.nodeV();
  return (node.equals(nodeV) && adjacent.contains(nodeU))
    || (node.equals(nodeU) && adjacent.contains(nodeV));
 }
}

 @Override
 public boolean contains(@NullableDecl Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (endpointPair.isOrdered()) {
   return false;
  }
  Set<N> adjacent = graph.adjacentNodes(node);
  Object nodeU = endpointPair.nodeU();
  Object nodeV = endpointPair.nodeV();
  return (node.equals(nodeV) && adjacent.contains(nodeU))
    || (node.equals(nodeU) && adjacent.contains(nodeV));
 }
}

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

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

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.transform(
     graph.adjacentNodes(node).iterator(),
     new Function<N, EndpointPair<N>>() {
      @Override
      public EndpointPair<N> apply(N adjacentNode) {
       return EndpointPair.unordered(node, adjacentNode);
      }
     }));
}

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.transform(
     graph.adjacentNodes(node).iterator(),
     new Function<N, EndpointPair<N>>() {
      @Override
      public EndpointPair<N> apply(N adjacentNode) {
       return EndpointPair.unordered(node, adjacentNode);
      }
     }));
}

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

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

 @Override
 public boolean contains(@Nullable Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (endpointPair.isOrdered()) {
   return false;
  }
  Set<N> adjacent = graph.adjacentNodes(node);
  Object nodeU = endpointPair.nodeU();
  Object nodeV = endpointPair.nodeV();
  return (node.equals(nodeV) && adjacent.contains(nodeU))
    || (node.equals(nodeU) && adjacent.contains(nodeV));
 }
}

 @Override
 public boolean contains(@NullableDecl Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (endpointPair.isOrdered()) {
   return false;
  }
  Set<N> adjacent = graph.adjacentNodes(node);
  Object nodeU = endpointPair.nodeU();
  Object nodeV = endpointPair.nodeV();
  return (node.equals(nodeV) && adjacent.contains(nodeU))
    || (node.equals(nodeU) && adjacent.contains(nodeV));
 }
}