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

Graph.containsVertex介绍

暂无

代码示例

代码示例来源：origin: net.sf.jung/jung-api

/**
   * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object)
   */
  public boolean containsVertex(V vertex) {
    return delegate.containsVertex(vertex);
  }
}

代码示例来源：origin: geogebra/geogebra

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object)
 */
@Override
public boolean containsVertex(V vertex) {
  return delegate.containsVertex(vertex);
}

代码示例来源：origin: geogebra/geogebra

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object)
 */
@Override
public boolean containsVertex(V vertex) {
  return delegate.containsVertex(vertex);
}

代码示例来源：origin: net.sf.jung/jung-api

/**
   * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object)
   */
  public boolean containsVertex(V vertex) {
    return delegate.containsVertex(vertex);
  }
}

代码示例来源：origin: net.sf.jung/jung-api

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object)
 */
public synchronized boolean containsVertex(V vertex) {
  return delegate.containsVertex(vertex);
}

代码示例来源：origin: net.sourceforge.jadex/jadex-tools-comanalyzer

/**
 * Returns <code>true</code> if the graph contains the vertex.
 * @param vertex The vertex.
 * @return <code>true</code> if the vertex is in the graph.
 */
public boolean containsVertex(Object vertex)
{
  return delegate.containsVertex(vertex);
}
/**

代码示例来源：origin: geogebra/geogebra

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object)
 */
@Override
public synchronized boolean containsVertex(V vertex) {
  return delegate.containsVertex(vertex);
}

代码示例来源：origin: iTransformers/netTransformer

public boolean FindNodeByIDEntireGraph(String name) {
  if (name != null && !name.isEmpty()) {
    if (entireGraph != null)
      return entireGraph.containsVertex(name);
    else
      return false;
  } else {
    return false;
  }
}

代码示例来源：origin: geogebra/geogebra

@Override
public V getParent(V child) {
  if (!delegate.containsVertex(child)) {
    return null;
  }
  Collection<V> parents = delegate.getPredecessors(child);
  if (parents.size() > 0) {
    return parents.iterator().next();
  }
  return null;
}

代码示例来源：origin: net.sf.jung/jung-graph-impl

/**
 * @param v the vertex to test
 * @return <code>true</code> if {@code v} has no children
 */
public boolean isLeaf(V v) {
  if (!delegate.containsVertex(v))
    return false;
  return getChildren(v).size() == 0;
}

代码示例来源：origin: geogebra/geogebra

/**
 * get the number of children of the passed parent node
 */
@Override
public int getChildCount(V parent) {
  if (!delegate.containsVertex(parent)) {
    return 0;
  }
  return getChildren(parent).size();
}

代码示例来源：origin: geogebra/geogebra

/**
 * get the immediate children nodes of the passed parent
 */
@Override
public Collection<V> getChildren(V parent) {
  if (!delegate.containsVertex(parent)) {
    return null;
  }
  return delegate.getSuccessors(parent);
}

代码示例来源：origin: net.sf.jung/jung-graph-impl

/**
 * get the number of children of the passed parent node
 */
public int getChildCount(V parent) {
  if (!delegate.containsVertex(parent))
    return 0;
  return getChildren(parent).size();
}

代码示例来源：origin: net.sf.jung/jung-graph-impl

/**
 * @param v the vertex to test
 * @return <code>true</code> if {@code v} has no parent
 */
public boolean isRoot(V v) {
  if (!delegate.containsVertex(v))
    return false;
  return getParent(v) == null;
}

代码示例来源：origin: geogebra/geogebra

/**
 * get the single parent node of the passed child
 */
@Override
public V getParent(V child) {
  if (!delegate.containsVertex(child)) {
    return null;
  }
  Collection<V> predecessors = delegate.getPredecessors(child);
  if (predecessors.size() == 0) {
    return null;
  }
  return predecessors.iterator().next();
}

代码示例来源：origin: geogebra/geogebra

/**
 * Returns <code>true</code> if the passed node has no children.
 * 
 * @return <code>true</code> if the passed node has no children
 */
public boolean isLeaf(V v) {
  if (!delegate.containsVertex(v)) {
    return false;
  }
  return getChildren(v).size() == 0;
}

代码示例来源：origin: geogebra/geogebra

/**
 * computes whether the passed node is a root node (has no children)
 */
public boolean isRoot(V v) {
  if (!delegate.containsVertex(v)) {
    return false;
  }
  return getParent(v) == null;
}

代码示例来源：origin: net.sf.jung/jung-graph-impl

/**
 * get the immediate children nodes of the passed parent
 */
public Collection<V> getChildren(V parent) {
  if (!delegate.containsVertex(parent))
    return null;
  return delegate.getSuccessors(parent);
}

代码示例来源：origin: net.sf.jung/jung-graph-impl

/**
 * @param v the vertex to test
 * @return <code>true</code> if <code>v</code> is neither 
 * a leaf nor the root of this tree
 */
public boolean isInternal(V v) {
  if (!delegate.containsVertex(v))
    return false;
  return isLeaf(v) == false && isRoot(v) == false;
}

代码示例来源：origin: geogebra/geogebra

/**
 * Returns <code>true</code> if <code>v</code> is neither a leaf nor the
 * root of this tree.
 * 
 * @return <code>true</code> if <code>v</code> is neither a leaf nor the
 *         root of this tree
 */
public boolean isInternal(V v) {
  if (!delegate.containsVertex(v)) {
    return false;
  }
  return isLeaf(v) == false && isRoot(v) == false;
}