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

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

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

origin: google/guava

@Override
public int size() {
 return graph.adjacentNodes(node).size();
}
origin: google/guava

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

@Override
public int degree(N node) {
 return delegate().degree(node);
}
origin: google/guava

@Override
public int size() {
 return graph.inDegree(node)
   + graph.outDegree(node)
   - (graph.successors(node).contains(node) ? 1 : 0);
}
origin: google/guava

@Override
public boolean isDirected() {
 return delegate().isDirected();
}
origin: google/guava

private EndpointPairIterator(BaseGraph<N> graph) {
 this.graph = graph;
 this.nodeIterator = graph.nodes().iterator();
}
origin: google/guava

 @Override
 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
  return delegate().hasEdgeConnecting(endpoints);
 }
}
origin: google/guava

/**
 * Defer to {@link AbstractGraph#edges()} (based on {@link #successors(Object)}) for full edges()
 * implementation.
 */
@Override
protected long edgeCount() {
 return delegate().edges().size();
}
origin: google/guava

@Override
public ElementOrder<N> nodeOrder() {
 return delegate().nodeOrder();
}
origin: google/guava

@Override
public int outDegree(N node) {
 return delegate().outDegree(node);
}
origin: google/guava

@Override
public int inDegree(N node) {
 return delegate().inDegree(node);
}
origin: google/j2objc

@Override
public int size() {
 return graph.inDegree(node)
   + graph.outDegree(node)
   - (graph.successors(node).contains(node) ? 1 : 0);
}
origin: google/j2objc

@Override
public boolean isDirected() {
 return delegate().isDirected();
}
origin: google/guava

private Undirected(BaseGraph<N> graph) {
 super(graph);
 this.visitedNodes = Sets.newHashSetWithExpectedSize(graph.nodes().size());
}
origin: google/guava

@Override
public boolean hasEdgeConnecting(N nodeU, N nodeV) {
 return delegate().hasEdgeConnecting(nodeU, nodeV);
}
origin: google/j2objc

/**
 * Defer to {@link AbstractGraph#edges()} (based on {@link #successors(Object)}) for full edges()
 * implementation.
 */
@Override
protected long edgeCount() {
 return delegate().edges().size();
}
origin: google/j2objc

@Override
public ElementOrder<N> nodeOrder() {
 return delegate().nodeOrder();
}
origin: google/j2objc

@Override
public int outDegree(N node) {
 return delegate().outDegree(node);
}
origin: google/j2objc

@Override
public int inDegree(N node) {
 return delegate().inDegree(node);
}
origin: wildfly/wildfly

@Override
public int size() {
 return graph.inDegree(node)
   + graph.outDegree(node)
   - (graph.successors(node).contains(node) ? 1 : 0);
}
com.google.common.graphBaseGraph

Javadoc

A non-public interface for the methods shared between Graph and ValueGraph.

Most used methods

  • adjacentNodes
    Returns the nodes which have an incident edge in common with node in this graph.
  • allowsSelfLoops
    Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting to ad
  • degree
    Returns the count of node's incident edges, counting self-loops twice (equivalently, the number of t
  • edges
    Returns all edges in this graph.
  • hasEdgeConnecting
    Returns true if there is an edge directly connecting nodeU to nodeV. This is equivalent to nodes().c
  • inDegree
    Returns the count of node's incoming edges (equal to predecessors(node).size()) in a directed graph.
  • isDirected
    Returns true if the edges in this graph are directed. Directed edges connect a EndpointPair#source()
  • nodeOrder
    Returns the order of iteration for the elements of #nodes().
  • nodes
    Returns all nodes in this graph, in the order specified by #nodeOrder().
  • outDegree
    Returns the count of node's outgoing edges (equal to successors(node).size()) in a directed graph. I
  • predecessors
  • successors
  • predecessors,
  • successors

Popular in Java

  • Running tasks concurrently on multiple threads
  • scheduleAtFixedRate (ScheduledExecutorService)
  • onCreateOptionsMenu (Activity)
  • requestLocationUpdates (LocationManager)
  • EOFException (java.io)
    Thrown when a program encounters the end of a file or stream during an input operation.
  • ByteBuffer (java.nio)
    A buffer for bytes. A byte buffer can be created in either one of the following ways: * #allocate
  • Timestamp (java.sql)
    A Java representation of the SQL TIMESTAMP type. It provides the capability of representing the SQL
  • Timer (java.util)
    Timers schedule one-shot or recurring TimerTask for execution. Prefer java.util.concurrent.Scheduled
  • Collectors (java.util.stream)
  • BasicDataSource (org.apache.commons.dbcp)
    Basic implementation of javax.sql.DataSource that is configured via JavaBeans properties. This is no
  • Top PhpStorm 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