com.google.common.graph.BaseGraph.predecessors 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 Set<N> predecessors(N node) {
 return delegate().predecessors(node);
}

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

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.concat(
     Iterators.transform(
       graph.predecessors(node).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N predecessor) {
         return EndpointPair.ordered(predecessor, node);
        }
       }),
     Iterators.transform(
       // filter out 'node' from successors (already covered by predecessors, above)
       Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N successor) {
         return EndpointPair.ordered(node, successor);
        }
       })));
}

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

 @Override
 public boolean contains(@Nullable Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (!endpointPair.isOrdered()) {
   return false;
  }
  Object source = endpointPair.source();
  Object target = endpointPair.target();
  return (node.equals(source) && graph.successors(node).contains(target))
    || (node.equals(target) && graph.predecessors(node).contains(source));
 }
}

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.concat(
     Iterators.transform(
       graph.predecessors(node).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N predecessor) {
         return EndpointPair.ordered(predecessor, node);
        }
       }),
     Iterators.transform(
       // filter out 'node' from successors (already covered by predecessors, above)
       Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N successor) {
         return EndpointPair.ordered(node, successor);
        }
       })));
}

 @Override
 public boolean contains(@NullableDecl Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (!endpointPair.isOrdered()) {
   return false;
  }
  Object source = endpointPair.source();
  Object target = endpointPair.target();
  return (node.equals(source) && graph.successors(node).contains(target))
    || (node.equals(target) && graph.predecessors(node).contains(source));
 }
}

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.concat(
     Iterators.transform(
       graph.predecessors(node).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N predecessor) {
         return EndpointPair.ordered(predecessor, node);
        }
       }),
     Iterators.transform(
       // filter out 'node' from successors (already covered by predecessors, above)
       Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N successor) {
         return EndpointPair.ordered(node, successor);
        }
       })));
}

 @Override
 public boolean contains(@NullableDecl Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (!endpointPair.isOrdered()) {
   return false;
  }
  Object source = endpointPair.source();
  Object target = endpointPair.target();
  return (node.equals(source) && graph.successors(node).contains(target))
    || (node.equals(target) && graph.predecessors(node).contains(source));
 }
}

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

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

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.concat(
     Iterators.transform(
       graph.predecessors(node).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N predecessor) {
         return EndpointPair.ordered(predecessor, node);
        }
       }),
     Iterators.transform(
       // filter out 'node' from successors (already covered by predecessors, above)
       Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N successor) {
         return EndpointPair.ordered(node, successor);
        }
       })));
}

@Override
public UnmodifiableIterator<EndpointPair<N>> iterator() {
 return Iterators.unmodifiableIterator(
   Iterators.concat(
     Iterators.transform(
       graph.predecessors(node).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N predecessor) {
         return EndpointPair.ordered(predecessor, node);
        }
       }),
     Iterators.transform(
       // filter out 'node' from successors (already covered by predecessors, above)
       Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(),
       new Function<N, EndpointPair<N>>() {
        @Override
        public EndpointPair<N> apply(N successor) {
         return EndpointPair.ordered(node, successor);
        }
       })));
}

 @Override
 public boolean contains(@Nullable Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (!endpointPair.isOrdered()) {
   return false;
  }
  Object source = endpointPair.source();
  Object target = endpointPair.target();
  return (node.equals(source) && graph.successors(node).contains(target))
    || (node.equals(target) && graph.predecessors(node).contains(source));
 }
}

 @Override
 public boolean contains(@NullableDecl Object obj) {
  if (!(obj instanceof EndpointPair)) {
   return false;
  }
  EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
  if (!endpointPair.isOrdered()) {
   return false;
  }
  Object source = endpointPair.source();
  Object target = endpointPair.target();
  return (node.equals(source) && graph.successors(node).contains(target))
    || (node.equals(target) && graph.predecessors(node).contains(source));
 }
}

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

successors

Popular in Java

Making http post requests using okhttp
setScale (BigDecimal)
requestLocationUpdates (LocationManager)
getSupportFragmentManager (FragmentActivity)
String (java.lang)
MalformedURLException (java.net)
This exception is thrown when a program attempts to create an URL from an incorrect specification.
HashSet (java.util)
HashSet is an implementation of a Set. All optional operations (adding and removing) are supported.
Queue (java.util)
A collection designed for holding elements prior to processing. Besides basic java.util.Collection o
ExecutorService (java.util.concurrent)
An Executor that provides methods to manage termination and methods that can produce a Future for tr
Pattern (java.util.regex)
Patterns are compiled regular expressions. In many cases, convenience methods such as String#matches
Top 17 Plugins for Android Studio

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

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

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