Tabnine Logo
BaseGraph.edges
Code IndexAdd Tabnine to your IDE (free)

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

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

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/j2objc

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

/**
 * Defer to {@link AbstractGraph#edges()} (based on {@link #successors(Object)}) for full edges()
 * implementation.
 */
@Override
protected long edgeCount() {
 return delegate().edges().size();
}
origin: org.jboss.eap/wildfly-client-all

/**
 * Defer to {@link AbstractGraph#edges()} (based on {@link #successors(Object)}) for full edges()
 * implementation.
 */
@Override
protected long edgeCount() {
 return delegate().edges().size();
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

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

Javadoc

Returns all edges in this graph.

Popular methods of BaseGraph

  • 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
  • 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
  • successors

Popular in Java

  • Parsing JSON documents to java classes using gson
  • getSystemService (Context)
  • scheduleAtFixedRate (Timer)
  • runOnUiThread (Activity)
  • Map (java.util)
    A Map is a data structure consisting of a set of keys and values in which each key is mapped to a si
  • NoSuchElementException (java.util)
    Thrown when trying to retrieve an element past the end of an Enumeration or Iterator.
  • Set (java.util)
    A Set is a data structure which does not allow duplicate elements.
  • UUID (java.util)
    UUID is an immutable representation of a 128-bit universally unique identifier (UUID). There are mul
  • Vector (java.util)
    Vector is an implementation of List, backed by an array and synchronized. All optional operations in
  • Logger (org.slf4j)
    The org.slf4j.Logger interface is the main user entry point of SLF4J API. It is expected that loggin
  • 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