com.google.common.graph.BaseGraph.isDirected java code examples

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
}

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

Javadoc

Returns true if the edges in this graph are directed. Directed edges connect a EndpointPair#source() to a EndpointPair#target(), while undirected edges connect a pair of nodes to each other.

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

Updating database using SQL prepared statement
getSharedPreferences (Context)
scheduleAtFixedRate (Timer)
onRequestPermissionsResult (Fragment)
Pointer (com.sun.jna)
An abstraction for a native pointer data type. A Pointer instance represents, on the Java side, a na
Cipher (javax.crypto)
This class provides access to implementations of cryptographic ciphers for encryption and decryption
ImageIO (javax.imageio)
Servlet (javax.servlet)
Defines methods that all servlets must implement. A servlet is a small Java program that runs within
DataSource (javax.sql)
An interface for the creation of Connection objects which represent a connection to a database. This
JTextField (javax.swing)
Sublime Text for Python

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

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

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