How to use

checkedConnections

method

in

com.google.common.graph.ConfigurableNetwork

@Override
public Set<E> outEdges(N node) {
 return checkedConnections(node).outEdges();
}

@Override
public Set<E> incidentEdges(N node) {
 return checkedConnections(node).incidentEdges();
}

@Override
public Set<N> predecessors(N node) {
 return checkedConnections(node).predecessors();
}

@Override
public Set<E> inEdges(N node) {
 return checkedConnections(node).inEdges();
}

@Override
public Set<N> successors(N node) {
 return checkedConnections(node).successors();
}

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

@Override
public Set<E> edgesConnecting(N nodeU, N nodeV) {
 NetworkConnections<N, E> connectionsU = checkedConnections(nodeU);
 if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality
  return ImmutableSet.of();
 }
 checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV);
 return connectionsU.edgesConnecting(nodeV);
}

@Override
public Set<E> outEdges(N node) {
 return checkedConnections(node).outEdges();
}

@Override
public Set<N> successors(N node) {
 return checkedConnections(node).successors();
}

@Override
public Set<E> incidentEdges(N node) {
 return checkedConnections(node).incidentEdges();
}

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

@Override
public Set<E> inEdges(N node) {
 return checkedConnections(node).inEdges();
}

@Override
public Set<N> predecessors(N node) {
 return checkedConnections(node).predecessors();
}

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

@Override
public Set<E> inEdges(N node) {
 return checkedConnections(node).inEdges();
}

@Override
public Set<E> edgesConnecting(N nodeU, N nodeV) {
 NetworkConnections<N, E> connectionsU = checkedConnections(nodeU);
 if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality
  return ImmutableSet.of();
 }
 checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV);
 return connectionsU.edgesConnecting(nodeV);
}

@Override
public Set<E> outEdges(N node) {
 return checkedConnections(node).outEdges();
}

@Override
public Set<N> predecessors(N node) {
 return checkedConnections(node).predecessors();
}

@Override
public Set<N> successors(N node) {
 return checkedConnections(node).successors();
}

@Override
public Set<E> edgesConnecting(N nodeU, N nodeV) {
 NetworkConnections<N, E> connectionsU = checkedConnections(nodeU);
 if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality
  return ImmutableSet.of();
 }
 checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV);
 return connectionsU.edgesConnecting(nodeV);
}