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

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

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

origin: google/guava

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

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

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

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

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

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

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

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

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

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

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

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");
origin: org.jboss.eap/wildfly-client-all

@Override
public boolean isDirected() {
 return delegate().isDirected();
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

@Override
public boolean isDirected() {
 return delegate().isDirected();
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}
origin: org.jboss.eap/wildfly-client-all

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}
origin: org.jboss.eap/wildfly-client-all

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}
origin: org.jboss.eap/wildfly-client-all

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");
origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

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

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

  • Start an intent from android
  • putExtra (Intent)
  • requestLocationUpdates (LocationManager)
  • scheduleAtFixedRate (ScheduledExecutorService)
  • MessageDigest (java.security)
    Uses a one-way hash function to turn an arbitrary number of bytes into a fixed-length byte sequence.
  • Handler (java.util.logging)
    A Handler object accepts a logging request and exports the desired messages to a target, for example
  • Pattern (java.util.regex)
    Patterns are compiled regular expressions. In many cases, convenience methods such as String#matches
  • Notification (javax.management)
  • FileUtils (org.apache.commons.io)
    General file manipulation utilities. Facilities are provided in the following areas: * writing to a
  • Project (org.apache.tools.ant)
    Central representation of an Ant project. This class defines an Ant project with all of its targets,
  • Best IntelliJ 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