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

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

Add the Codota plugin to your IDE and get smart completions

private void myMethod () {
 Connection c =DataSource dataSource;dataSource.getConnection()
String url;DriverManager.getConnection(url)
IdentityDatabaseUtil.getDBConnection()
Smart code suggestions by Tabnine
}

private EndpointPairIterator(BaseGraph<N> graph) {
 this.graph = graph;
 this.nodeIterator = graph.nodes().iterator();
}

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

private EndpointPairIterator(BaseGraph<N> graph) {
 this.graph = graph;
 this.nodeIterator = graph.nodes().iterator();
}

@Override
public Set<N> nodes() {
 return delegate().nodes();
}

private EndpointPairIterator(BaseGraph<N> graph) {
 this.graph = graph;
 this.nodeIterator = graph.nodes().iterator();
}

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

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

@Override
public Set<N> nodes() {
 return delegate().nodes();
}

@Override
public Set<N> nodes() {
 return delegate().nodes();
}

private EndpointPairIterator(BaseGraph<N> graph) {
 this.graph = graph;
 this.nodeIterator = graph.nodes().iterator();
}

private EndpointPairIterator(BaseGraph<N> graph) {
 this.graph = graph;
 this.nodeIterator = graph.nodes().iterator();
}

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

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

@Override
public Set<N> nodes() {
 return delegate().nodes();
}

@Override
public Set<N> nodes() {
 return delegate().nodes();
}

Javadoc

Returns all nodes in this graph, in the order specified by #nodeOrder().

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
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().
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

Making http requests using okhttp
getSystemService (Context)
setRequestProperty (URLConnection)
getExternalFilesDir (Context)
BorderLayout (java.awt)
A border layout lays out a container, arranging and resizing its components to fit in five regions:
Proxy (java.net)
This class represents proxy server settings. A created instance of Proxy stores a type and an addres
Socket (java.net)
Provides a client-side TCP socket.
DecimalFormat (java.text)
A concrete subclass of NumberFormat that formats decimal numbers. It has a variety of features desig
Collection (java.util)
Collection is the root of the collection hierarchy. It defines operations on data collections and t
Runner (org.openjdk.jmh.runner)
Top 17 Free Sublime Text Plugins

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

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

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