How to use

addOutEdge

method

in

com.google.common.graph.AbstractUndirectedNetworkConnections

@Override
public void addInEdge(E edge, N node, boolean isSelfLoop) {
 if (!isSelfLoop) {
  addOutEdge(edge, node);
 }
}

@Override
public void addInEdge(E edge, N node, boolean isSelfLoop) {
 if (!isSelfLoop) {
  addOutEdge(edge, node);
 }
}

@Override
public void addInEdge(E edge, N node, boolean isSelfLoop) {
 if (!isSelfLoop) {
  addOutEdge(edge, node);
 }
}

@Override
public void addOutEdge(E edge, N node) {
 super.addOutEdge(edge, node);
 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
 if (adjacentNodes != null) {
  checkState(adjacentNodes.add(node));
 }
}

@Override
public void addOutEdge(E edge, N node) {
 super.addOutEdge(edge, node);
 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
 if (adjacentNodes != null) {
  checkState(adjacentNodes.add(node));
 }
}

@Override
public void addOutEdge(E edge, N node) {
 super.addOutEdge(edge, node);
 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
 if (adjacentNodes != null) {
  checkState(adjacentNodes.add(node));
 }
}

@Override
public void addInEdge(E edge, N node, boolean isSelfLoop) {
 if (!isSelfLoop) {
  addOutEdge(edge, node);
 }
}

@Override
public void addInEdge(E edge, N node, boolean isSelfLoop) {
 if (!isSelfLoop) {
  addOutEdge(edge, node);
 }
}

@Override
public void addOutEdge(E edge, N node) {
 super.addOutEdge(edge, node);
 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
 if (adjacentNodes != null) {
  checkState(adjacentNodes.add(node));
 }
}

@Override
public void addOutEdge(E edge, N node) {
 super.addOutEdge(edge, node);
 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
 if (adjacentNodes != null) {
  checkState(adjacentNodes.add(node));
 }
}