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

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

@Override
public int degree(N node) {
 return delegate().degree(node);
}

@Override
public int degree(N node) {
 return delegate().degree(node);
}

@Override
public int degree(N node) {
 return delegate().degree(node);
}

@Override
public int degree(N node) {
 return delegate().degree(node);
}

@Override
public int degree(N node) {
 return delegate().degree(node);
}

Returns the count of node's incident edges, counting self-loops twice (equivalently, the number of times an edge touches node).

For directed graphs, this is equal to inDegree(node) + outDegree(node).

For undirected graphs, this is equal to incidentEdges(node).size() + (number of self-loops incident to node).

If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.

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

Parsing JSON documents to java classes using gson
setRequestProperty (URLConnection)
putExtra (Intent)
getSupportFragmentManager (FragmentActivity)
FileOutputStream (java.io)
An output stream that writes bytes to a file. If the output file exists, it can be replaced or appen
OutputStream (java.io)
A writable sink for bytes.Most clients will use output streams that write data to the file system (
Enumeration (java.util)
A legacy iteration interface.New code should use Iterator instead. Iterator replaces the enumeration
Vector (java.util)
Vector is an implementation of List, backed by an array and synchronized. All optional operations in
AtomicInteger (java.util.concurrent.atomic)
An int value that may be updated atomically. See the java.util.concurrent.atomic package specificati
Notification (javax.management)
Top Vim plugins