本文整理了Java中com.ibm.wala.util.graph.Graph.containsNode()方法的一些代码示例，展示了Graph.containsNode()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Graph.containsNode()方法的具体详情如下：
包路径：com.ibm.wala.util.graph.Graph
类名称：Graph
方法名：containsNode

Graph.containsNode介绍

暂无

代码示例

代码示例来源：origin: wala/WALA

@Override
public boolean containsNode(T N) {
 return delegate.containsNode(N);
}

代码示例来源：origin: wala/WALA

@Override
public boolean containsNode(T N) {
 return delegate.containsNode(N);
}

代码示例来源：origin: wala/WALA

@Override
public boolean containsNode(T N) {
 return delegate.containsNode(N);
}

代码示例来源：origin: com.ibm.wala/com.ibm.wala.util

@Override
public boolean containsNode(T N) {
 return delegate.containsNode(N);
}

代码示例来源：origin: wala/WALA

@Override
public boolean containsNode(T N) {
 return delegate.containsNode(N);
}

代码示例来源：origin: com.ibm.wala/com.ibm.wala.util

@Override
public boolean containsNode(T N) {
 return delegate.containsNode(N);
}

代码示例来源：origin: com.ibm.wala/com.ibm.wala.util

@Override
public boolean containsNode(E N) {
 return G.containsNode(N) && fmember.test(N);
}

代码示例来源：origin: wala/WALA

@Override
public boolean containsNode(T n) {
 return p.test(n) && g.containsNode(n);
}

代码示例来源：origin: wala/WALA

@Override
public boolean containsNode(T n) {
 return p.test(n) && g.containsNode(n);
}

代码示例来源：origin: wala/WALA

@Override
public boolean containsNode(E N) {
 return G.containsNode(N) && fmember.test(N);
}

代码示例来源：origin: wala/WALA

@Override
public boolean containsNode(E N) {
 return G.containsNode(N) && fmember.test(N);
}

代码示例来源：origin: com.ibm.wala/com.ibm.wala.util

@Override
public boolean containsNode(T n) {
 return p.test(n) && g.containsNode(n);
}

代码示例来源：origin: wala/WALA

/**
 * Construct a depth-first enumerator starting with a particular node in a directed graph.
 * 
 * @param G the graph whose nodes to enumerate
 * @throws IllegalArgumentException if G is null
 */
public DFSPathFinder(Graph<T> G, T N, Predicate<T> f) throws IllegalArgumentException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 if (!G.containsNode(N)) {
  throw new IllegalArgumentException("source node not in graph: " + N);
 }
 this.G = G;
 this.roots = new NonNullSingletonIterator<>(N);
 this.filter = f;
}

代码示例来源：origin: wala/WALA

/**
 * Construct a breadth-first enumerator starting with a particular node in a directed graph.
 * 
 * @param G the graph whose nodes to enumerate
 * @throws IllegalArgumentException if G is null
 */
public BFSPathFinder(Graph<T> G, T src, final T target) throws IllegalArgumentException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 this.G = G;
 this.roots = new NonNullSingletonIterator<>(src);
 if (!G.containsNode(src)) {
  throw new IllegalArgumentException("src is not in graph " + src);
 }
 this.filter = target::equals;
}

代码示例来源：origin: wala/WALA

/**
 * Construct a breadth-first enumerator starting with a particular node in a directed graph.
 * 
 * @param G the graph whose nodes to enumerate
 * @throws IllegalArgumentException if G is null
 */
public BFSPathFinder(Graph<T> G, T src, final T target) throws IllegalArgumentException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 this.G = G;
 this.roots = new NonNullSingletonIterator<>(src);
 if (!G.containsNode(src)) {
  throw new IllegalArgumentException("src is not in graph " + src);
 }
 this.filter = target::equals;
}

代码示例来源：origin: wala/WALA

/**
 * Construct a depth-first enumerator starting with a particular node in a directed graph.
 * 
 * @param G the graph whose nodes to enumerate
 * @throws IllegalArgumentException if G is null
 */
public DFSPathFinder(Graph<T> G, T N, Predicate<T> f) throws IllegalArgumentException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 if (!G.containsNode(N)) {
  throw new IllegalArgumentException("source node not in graph: " + N);
 }
 this.G = G;
 this.roots = new NonNullSingletonIterator<>(N);
 this.filter = f;
}

代码示例来源：origin: wala/WALA

/**
 * Construct a depth-first enumerator starting with a particular node in a directed graph.
 * 
 * @param G the graph whose nodes to enumerate
 * @throws IllegalArgumentException if G is null
 */
public SlowDFSFinishTimeIterator(Graph<T> G, T N) throws IllegalArgumentException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 if (!G.containsNode(N)) {
  throw new IllegalArgumentException("source node not in graph: " + N);
 }
 init(G, new NonNullSingletonIterator<>(N));
}

代码示例来源：origin: wala/WALA

/**
 * Construct a depth-first enumerator starting with a particular node in a directed graph.
 * 
 * @param G the graph whose nodes to enumerate
 * @throws IllegalArgumentException if G is null
 */
public SlowDFSFinishTimeIterator(Graph<T> G, T N) throws IllegalArgumentException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 if (!G.containsNode(N)) {
  throw new IllegalArgumentException("source node not in graph: " + N);
 }
 init(G, new NonNullSingletonIterator<>(N));
}

代码示例来源：origin: com.ibm.wala/com.ibm.wala.util

/**
 * Construct a depth-first enumerator starting with a particular node in a directed graph.
 * 
 * @param G the graph whose nodes to enumerate
 * @throws IllegalArgumentException if G is null
 */
public SlowDFSFinishTimeIterator(Graph<T> G, T N) throws IllegalArgumentException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 if (!G.containsNode(N)) {
  throw new IllegalArgumentException("source node not in graph: " + N);
 }
 init(G, new NonNullSingletonIterator<>(N));
}

代码示例来源：origin: wala/WALA

private static Graph<String> createGraph(String edges) {
 Graph<String> g = SlowSparseNumberedGraph.make();
 for(int i = 0; i < edges.length(); i+= 2) {
  String from = edges.substring(i, i+1);
  if (! g.containsNode(from)) {
   g.addNode(from);
  }
  
  String to = edges.substring(i+1, i+2);
  if (! g.containsNode(to)) {
   g.addNode(to);
  }
  
  g.addEdge(from, to);
 }
 return g;
}