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

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

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

origin: google/guava

@Override
public Set<N> adjacentNodes(N node) {
 return AbstractNetwork.this.adjacentNodes(node);
}
origin: google/guava

/** Returns a string representation of this network. */
@Override
public String toString() {
 return "isDirected: "
   + isDirected()
   + ", allowsParallelEdges: "
   + allowsParallelEdges()
   + ", allowsSelfLoops: "
   + allowsSelfLoops()
   + ", nodes: "
   + nodes()
   + ", edges: "
   + edgeIncidentNodesMap(this);
}
origin: google/guava

@Override
public Set<E> edgesConnecting(N nodeU, N nodeV) {
 Set<E> outEdgesU = outEdges(nodeU);
 Set<E> inEdgesV = inEdges(nodeV);
 return outEdgesU.size() <= inEdgesV.size()
   ? unmodifiableSet(Sets.filter(outEdgesU, connectedPredicate(nodeU, nodeV)))
   : unmodifiableSet(Sets.filter(inEdgesV, connectedPredicate(nodeV, nodeU)));
}
origin: google/guava

@Override
public int inDegree(N node) {
 return isDirected() ? inEdges(node).size() : degree(node);
}
origin: google/guava

@Override
public int outDegree(N node) {
 return isDirected() ? outEdges(node).size() : degree(node);
}
origin: google/guava

@Override
public int degree(N node) {
 if (isDirected()) {
  return IntMath.saturatedAdd(inEdges(node).size(), outEdges(node).size());
 } else {
  return IntMath.saturatedAdd(incidentEdges(node).size(), edgesConnecting(node, node).size());
 }
}
origin: google/guava

@Override
public final boolean equals(@Nullable Object obj) {
 if (obj == this) {
  return true;
 }
 if (!(obj instanceof Network)) {
  return false;
 }
 Network<?, ?> other = (Network<?, ?>) obj;
 return isDirected() == other.isDirected()
   && nodes().equals(other.nodes())
   && edgeIncidentNodesMap(this).equals(edgeIncidentNodesMap(other));
}
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: google/guava

@Override
public boolean hasEdgeConnecting(N nodeU, N nodeV) {
 return !edgesConnecting(nodeU, nodeV).isEmpty();
}
origin: google/guava

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

@Override
public boolean allowsSelfLoops() {
 return AbstractNetwork.this.allowsSelfLoops();
}
origin: google/guava

@Override
public final int hashCode() {
 return edgeIncidentNodesMap(this).hashCode();
}
origin: google/guava

@Override
public Set<EndpointPair<N>> edges() {
 if (allowsParallelEdges()) {
  return super.edges(); // Defer to AbstractGraph implementation.
origin: google/guava

@Override
public Set<E> edgesConnecting(EndpointPair<N> endpoints) {
 validateEndpoints(endpoints);
 return edgesConnecting(endpoints.nodeU(), endpoints.nodeV());
}
origin: google/guava

@Override
public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
 checkNotNull(endpoints);
 if (!isOrderingCompatible(endpoints)) {
  return false;
 }
 return !edgesConnecting(endpoints.nodeU(), endpoints.nodeV()).isEmpty();
}
origin: google/j2objc

@Override
public int degree(N node) {
 if (isDirected()) {
  return IntMath.saturatedAdd(inEdges(node).size(), outEdges(node).size());
 } else {
  return IntMath.saturatedAdd(incidentEdges(node).size(), edgesConnecting(node, node).size());
 }
}
origin: google/j2objc

@Override
public final boolean equals(@NullableDecl Object obj) {
 if (obj == this) {
  return true;
 }
 if (!(obj instanceof Network)) {
  return false;
 }
 Network<?, ?> other = (Network<?, ?>) obj;
 return isDirected() == other.isDirected()
   && nodes().equals(other.nodes())
   && edgeIncidentNodesMap(this).equals(edgeIncidentNodesMap(other));
}
origin: google/j2objc

@Override
public int inDegree(N node) {
 return isDirected() ? inEdges(node).size() : degree(node);
}
origin: google/j2objc

@Override
public int outDegree(N node) {
 return isDirected() ? outEdges(node).size() : degree(node);
}
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));
}
com.google.common.graphAbstractNetwork

Javadoc

This class provides a skeletal implementation of Network. It is recommended to extend this class rather than implement Network directly.

The methods implemented in this class should not be overridden unless the subclass admits a more efficient implementation.

Most used methods

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

Popular in Java

  • Finding current android device location
  • getSystemService (Context)
  • requestLocationUpdates (LocationManager)
  • runOnUiThread (Activity)
  • PrintStream (java.io)
    Fake signature of an existing Java class.
  • BitSet (java.util)
    The BitSet class implements abit array [http://en.wikipedia.org/wiki/Bit_array]. Each element is eit
  • Set (java.util)
    A Set is a data structure which does not allow duplicate elements.
  • TreeMap (java.util)
    Walk the nodes of the tree left-to-right or right-to-left. Note that in descending iterations, next
  • TreeSet (java.util)
    TreeSet is an implementation of SortedSet. All optional operations (adding and removing) are support
  • Annotation (javassist.bytecode.annotation)
    The annotation structure.An instance of this class is returned bygetAnnotations() in AnnotationsAttr
  • Top Sublime Text plugins
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