congrats Icon
New! Announcing Tabnine Chat Beta
Learn More
Tabnine Logo
AbstractNetwork.incidentNodes
Code IndexAdd Tabnine to your IDE (free)

How to use
incidentNodes
method
in
com.google.common.graph.AbstractNetwork

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

origin: google/guava

 @Override
 public boolean apply(E edge) {
  return incidentNodes(edge).adjacentNode(nodePresent).equals(nodeToCheck);
 }
};
origin: google/j2objc

 @Override
 public boolean apply(E edge) {
  return incidentNodes(edge).adjacentNode(nodePresent).equals(nodeToCheck);
 }
};
origin: google/guava

@Override
public Set<E> adjacentEdges(E edge) {
 EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network.
 Set<E> endpointPairIncidentEdges =
   Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV()));
 return Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge));
}
origin: wildfly/wildfly

 @Override
 public boolean apply(E edge) {
  return incidentNodes(edge).adjacentNode(nodePresent).equals(nodeToCheck);
 }
};
origin: google/j2objc

@Override
public Set<E> adjacentEdges(E edge) {
 EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network.
 Set<E> endpointPairIncidentEdges =
   Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV()));
 return Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge));
}
origin: wildfly/wildfly

@Override
public Set<E> adjacentEdges(E edge) {
 EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network.
 Set<E> endpointPairIncidentEdges =
   Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV()));
 return Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge));
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

 @Override
 public boolean apply(E edge) {
  return incidentNodes(edge).adjacentNode(nodePresent).equals(nodeToCheck);
 }
};
origin: org.jboss.eap/wildfly-client-all

 @Override
 public boolean apply(E edge) {
  return incidentNodes(edge).adjacentNode(nodePresent).equals(nodeToCheck);
 }
};
origin: org.jboss.eap/wildfly-client-all

@Override
public Set<E> adjacentEdges(E edge) {
 EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network.
 Set<E> endpointPairIncidentEdges =
   Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV()));
 return Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge));
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

@Override
public Set<E> adjacentEdges(E edge) {
 EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network.
 Set<E> endpointPairIncidentEdges =
   Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV()));
 return Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge));
}
com.google.common.graphAbstractNetworkincidentNodes

Popular methods of AbstractNetwork

  • adjacentNodes
  • allowsParallelEdges
  • allowsSelfLoops
  • connectedPredicate
  • degree
  • edgeIncidentNodesMap
  • edgesConnecting
  • inEdges
  • incidentEdges
  • isDirected
  • nodeOrder
  • nodes
  • nodeOrder,
  • nodes,
  • outEdges,
  • predecessors,
  • successors,
  • edgeConnecting,
  • edgeConnectingOrNull,
  • isOrderingCompatible,
  • validateEndpoints

Popular in Java

  • Start an intent from android
  • compareTo (BigDecimal)
  • orElseThrow (Optional)
    Return the contained value, if present, otherwise throw an exception to be created by the provided s
  • putExtra (Intent)
  • Connection (java.sql)
    A connection represents a link from a Java application to a database. All SQL statements and results
  • Collection (java.util)
    Collection is the root of the collection hierarchy. It defines operations on data collections and t
  • Properties (java.util)
    A Properties object is a Hashtable where the keys and values must be Strings. Each property can have
  • Stack (java.util)
    Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of objects. It enables u
  • TreeSet (java.util)
    TreeSet is an implementation of SortedSet. All optional operations (adding and removing) are support
  • Location (org.springframework.beans.factory.parsing)
    Class that models an arbitrary location in a Resource.Typically used to track the location of proble
  • Github Copilot alternatives
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now