How to use

EndpointPairIterator$Undirected

in

com.google.common.graph

 @Override
 protected EndpointPair<N> computeNext() {
  while (true) {
   while (successorIterator.hasNext()) {
    N otherNode = successorIterator.next();
    if (!visitedNodes.contains(otherNode)) {
     return EndpointPair.unordered(node, otherNode);
    }
   }
   // Add to visited set *after* processing neighbors so we still include self-loops.
   visitedNodes.add(node);
   if (!advance()) {
    visitedNodes = null;
    return endOfData();
   }
  }
 }
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

 @Override
 protected EndpointPair<N> computeNext() {
  while (true) {
   while (successorIterator.hasNext()) {
    N otherNode = successorIterator.next();
    if (!visitedNodes.contains(otherNode)) {
     return EndpointPair.unordered(node, otherNode);
    }
   }
   // Add to visited set *after* processing neighbors so we still include self-loops.
   visitedNodes.add(node);
   if (!advance()) {
    visitedNodes = null;
    return endOfData();
   }
  }
 }
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

 @Override
 protected EndpointPair<N> computeNext() {
  while (true) {
   while (successorIterator.hasNext()) {
    N otherNode = successorIterator.next();
    if (!visitedNodes.contains(otherNode)) {
     return EndpointPair.unordered(node, otherNode);
    }
   }
   // Add to visited set *after* processing neighbors so we still include self-loops.
   visitedNodes.add(node);
   if (!advance()) {
    visitedNodes = null;
    return endOfData();
   }
  }
 }
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

 @Override
 protected EndpointPair<N> computeNext() {
  while (true) {
   while (successorIterator.hasNext()) {
    N otherNode = successorIterator.next();
    if (!visitedNodes.contains(otherNode)) {
     return EndpointPair.unordered(node, otherNode);
    }
   }
   // Add to visited set *after* processing neighbors so we still include self-loops.
   visitedNodes.add(node);
   if (!advance()) {
    visitedNodes = null;
    return endOfData();
   }
  }
 }
}

 @Override
 protected EndpointPair<N> computeNext() {
  while (true) {
   while (successorIterator.hasNext()) {
    N otherNode = successorIterator.next();
    if (!visitedNodes.contains(otherNode)) {
     return EndpointPair.unordered(node, otherNode);
    }
   }
   // Add to visited set *after* processing neighbors so we still include self-loops.
   visitedNodes.add(node);
   if (!advance()) {
    visitedNodes = null;
    return endOfData();
   }
  }
 }
}