com.google.common.graph.ConfigurableMutableValueGraph.allowsSelfLoops java code examples

Common ways to obtain ConfigurableMutableValueGraph

private void myMethod () {
 ConfigurableMutableValueGraph c =AbstractGraphBuilder builder;new ConfigurableMutableValueGraph<>(builder)
Smart code suggestions by Tabnine
}

@Override
@CanIgnoreReturnValue
public V putEdgeValue(N nodeU, N nodeV, V value) {
 checkNotNull(nodeU, "nodeU");
 checkNotNull(nodeV, "nodeV");
 checkNotNull(value, "value");
 if (!allowsSelfLoops()) {
  checkArgument(!nodeU.equals(nodeV), SELF_LOOPS_NOT_ALLOWED, nodeU);
 }
 GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU);
 if (connectionsU == null) {
  connectionsU = addNodeInternal(nodeU);
 }
 V previousValue = connectionsU.addSuccessor(nodeV, value);
 GraphConnections<N, V> connectionsV = nodeConnections.get(nodeV);
 if (connectionsV == null) {
  connectionsV = addNodeInternal(nodeV);
 }
 connectionsV.addPredecessor(nodeU, value);
 if (previousValue == null) {
  checkPositive(++edgeCount);
 }
 return previousValue;
}

@Override
@CanIgnoreReturnValue
public V putEdgeValue(N nodeU, N nodeV, V value) {
 checkNotNull(nodeU, "nodeU");
 checkNotNull(nodeV, "nodeV");
 checkNotNull(value, "value");
 if (!allowsSelfLoops()) {
  checkArgument(!nodeU.equals(nodeV), SELF_LOOPS_NOT_ALLOWED, nodeU);
 }
 GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU);
 if (connectionsU == null) {
  connectionsU = addNodeInternal(nodeU);
 }
 V previousValue = connectionsU.addSuccessor(nodeV, value);
 GraphConnections<N, V> connectionsV = nodeConnections.get(nodeV);
 if (connectionsV == null) {
  connectionsV = addNodeInternal(nodeV);
 }
 connectionsV.addPredecessor(nodeU, value);
 if (previousValue == null) {
  checkPositive(++edgeCount);
 }
 return previousValue;
}

@Override
@CanIgnoreReturnValue
public V putEdgeValue(N nodeU, N nodeV, V value) {
 checkNotNull(nodeU, "nodeU");
 checkNotNull(nodeV, "nodeV");
 checkNotNull(value, "value");
 if (!allowsSelfLoops()) {
  checkArgument(!nodeU.equals(nodeV), SELF_LOOPS_NOT_ALLOWED, nodeU);
 }
 GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU);
 if (connectionsU == null) {
  connectionsU = addNodeInternal(nodeU);
 }
 V previousValue = connectionsU.addSuccessor(nodeV, value);
 GraphConnections<N, V> connectionsV = nodeConnections.get(nodeV);
 if (connectionsV == null) {
  connectionsV = addNodeInternal(nodeV);
 }
 connectionsV.addPredecessor(nodeU, value);
 if (previousValue == null) {
  checkPositive(++edgeCount);
 }
 return previousValue;
}

@Override
@CanIgnoreReturnValue
public boolean removeNode(N node) {
 checkNotNull(node, "node");
 GraphConnections<N, V> connections = nodeConnections.get(node);
 if (connections == null) {
  return false;
 }
 if (allowsSelfLoops()) {
  // Remove self-loop (if any) first, so we don't get CME while removing incident edges.
  if (connections.removeSuccessor(node) != null) {
   connections.removePredecessor(node);
   --edgeCount;
  }
 }
 for (N successor : connections.successors()) {
  nodeConnections.getWithoutCaching(successor).removePredecessor(node);
  --edgeCount;
 }
 if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal.
  for (N predecessor : connections.predecessors()) {
   checkState(nodeConnections.getWithoutCaching(predecessor).removeSuccessor(node) != null);
   --edgeCount;
  }
 }
 nodeConnections.remove(node);
 checkNonNegative(edgeCount);
 return true;
}

@Override
@CanIgnoreReturnValue
public boolean removeNode(N node) {
 checkNotNull(node, "node");
 GraphConnections<N, V> connections = nodeConnections.get(node);
 if (connections == null) {
  return false;
 }
 if (allowsSelfLoops()) {
  // Remove self-loop (if any) first, so we don't get CME while removing incident edges.
  if (connections.removeSuccessor(node) != null) {
   connections.removePredecessor(node);
   --edgeCount;
  }
 }
 for (N successor : connections.successors()) {
  nodeConnections.getWithoutCaching(successor).removePredecessor(node);
  --edgeCount;
 }
 if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal.
  for (N predecessor : connections.predecessors()) {
   checkState(nodeConnections.getWithoutCaching(predecessor).removeSuccessor(node) != null);
   --edgeCount;
  }
 }
 nodeConnections.remove(node);
 checkNonNegative(edgeCount);
 return true;
}

@Override
@CanIgnoreReturnValue
public boolean removeNode(N node) {
 checkNotNull(node, "node");
 GraphConnections<N, V> connections = nodeConnections.get(node);
 if (connections == null) {
  return false;
 }
 if (allowsSelfLoops()) {
  // Remove self-loop (if any) first, so we don't get CME while removing incident edges.
  if (connections.removeSuccessor(node) != null) {
   connections.removePredecessor(node);
   --edgeCount;
  }
 }
 for (N successor : connections.successors()) {
  nodeConnections.getWithoutCaching(successor).removePredecessor(node);
  --edgeCount;
 }
 if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal.
  for (N predecessor : connections.predecessors()) {
   checkState(nodeConnections.getWithoutCaching(predecessor).removeSuccessor(node) != null);
   --edgeCount;
  }
 }
 nodeConnections.remove(node);
 checkNonNegative(edgeCount);
 return true;
}

@Override
@CanIgnoreReturnValue
public V putEdgeValue(N nodeU, N nodeV, V value) {
 checkNotNull(nodeU, "nodeU");
 checkNotNull(nodeV, "nodeV");
 checkNotNull(value, "value");
 if (!allowsSelfLoops()) {
  checkArgument(!nodeU.equals(nodeV), SELF_LOOPS_NOT_ALLOWED, nodeU);
 }
 GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU);
 if (connectionsU == null) {
  connectionsU = addNodeInternal(nodeU);
 }
 V previousValue = connectionsU.addSuccessor(nodeV, value);
 GraphConnections<N, V> connectionsV = nodeConnections.get(nodeV);
 if (connectionsV == null) {
  connectionsV = addNodeInternal(nodeV);
 }
 connectionsV.addPredecessor(nodeU, value);
 if (previousValue == null) {
  checkPositive(++edgeCount);
 }
 return previousValue;
}

@Override
@CanIgnoreReturnValue
public V putEdgeValue(N nodeU, N nodeV, V value) {
 checkNotNull(nodeU, "nodeU");
 checkNotNull(nodeV, "nodeV");
 checkNotNull(value, "value");
 if (!allowsSelfLoops()) {
  checkArgument(!nodeU.equals(nodeV), SELF_LOOPS_NOT_ALLOWED, nodeU);
 }
 GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU);
 if (connectionsU == null) {
  connectionsU = addNodeInternal(nodeU);
 }
 V previousValue = connectionsU.addSuccessor(nodeV, value);
 GraphConnections<N, V> connectionsV = nodeConnections.get(nodeV);
 if (connectionsV == null) {
  connectionsV = addNodeInternal(nodeV);
 }
 connectionsV.addPredecessor(nodeU, value);
 if (previousValue == null) {
  checkPositive(++edgeCount);
 }
 return previousValue;
}

@Override
@CanIgnoreReturnValue
public boolean removeNode(N node) {
 checkNotNull(node, "node");
 GraphConnections<N, V> connections = nodeConnections.get(node);
 if (connections == null) {
  return false;
 }
 if (allowsSelfLoops()) {
  // Remove self-loop (if any) first, so we don't get CME while removing incident edges.
  if (connections.removeSuccessor(node) != null) {
   connections.removePredecessor(node);
   --edgeCount;
  }
 }
 for (N successor : connections.successors()) {
  nodeConnections.getWithoutCaching(successor).removePredecessor(node);
  --edgeCount;
 }
 if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal.
  for (N predecessor : connections.predecessors()) {
   checkState(nodeConnections.getWithoutCaching(predecessor).removeSuccessor(node) != null);
   --edgeCount;
  }
 }
 nodeConnections.remove(node);
 checkNonNegative(edgeCount);
 return true;
}

@Override
@CanIgnoreReturnValue
public boolean removeNode(N node) {
 checkNotNull(node, "node");
 GraphConnections<N, V> connections = nodeConnections.get(node);
 if (connections == null) {
  return false;
 }
 if (allowsSelfLoops()) {
  // Remove self-loop (if any) first, so we don't get CME while removing incident edges.
  if (connections.removeSuccessor(node) != null) {
   connections.removePredecessor(node);
   --edgeCount;
  }
 }
 for (N successor : connections.successors()) {
  nodeConnections.getWithoutCaching(successor).removePredecessor(node);
  --edgeCount;
 }
 if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal.
  for (N predecessor : connections.predecessors()) {
   checkState(nodeConnections.getWithoutCaching(predecessor).removeSuccessor(node) != null);
   --edgeCount;
  }
 }
 nodeConnections.remove(node);
 checkNonNegative(edgeCount);
 return true;
}

Popular methods of ConfigurableMutableValueGraph

<init>
Constructs a mutable graph with the properties specified in builder.
addNodeInternal
Adds node to the graph and returns the associated GraphConnections.
containsNode
isDirected
newConnections
putEdgeValue
removeEdge
validateEndpoints

Popular in Java

Finding current android device location
getApplicationContext (Context)
getExternalFilesDir (Context)
runOnUiThread (Activity)
BufferedImage (java.awt.image)
The BufferedImage subclass describes an java.awt.Image with an accessible buffer of image data. All
KeyStore (java.security)
KeyStore is responsible for maintaining cryptographic keys and their owners. The type of the syste
Dictionary (java.util)
Note: Do not use this class since it is obsolete. Please use the Map interface for new implementatio
Timer (java.util)
Timers schedule one-shot or recurring TimerTask for execution. Prefer java.util.concurrent.Scheduled
JOptionPane (javax.swing)
Option (scala)

How to use allowsSelfLoopsmethodin com.google.common.graph.ConfigurableMutableValueGraph

Best Java code snippets using com.google.common.graph.ConfigurableMutableValueGraph.allowsSelfLoops (Showing top 10 results out of 315)

How to use
allowsSelfLoops
method
in
com.google.common.graph.ConfigurableMutableValueGraph