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

Graph.getSuccessorCount介绍

[英]Returns the number of successors that vertex has in this graph. Equivalent to vertex.getSuccessors().size().
[中]返回vertex在此图形中的后续数。相当于vertex.getSuccessors().size()。

代码示例

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

/**
 * Returns the number of vertices that have an incoming edge from the given vertex.
 * @param vertex The vertex.
 * @return The successor count.
 */
public int getSuccessorCount(Object vertex)
{
  return delegate.getSuccessorCount(vertex);
}

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

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

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

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

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

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

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

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

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

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

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

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

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

public int getChildCount(V vertex)
{
  return delegate.getSuccessorCount(vertex);
}

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

@Override
public int getChildCount(V vertex) {
  return delegate.getSuccessorCount(vertex);
}

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

public int getSuccessorCount(V vertex) {
  return graph.getSuccessorCount(vertex);
}
public Collection<V> getSuccessors(V vertex) {

代码示例来源：origin: net.sourceforge.ondex.apps/ovtk2-default

/**
 * Returns list of nodes that are roots of trees in the graph.
 * 
 * @param graph
 *            ONDEXJUNGGraph
 * @return list of root nodes
 */
private Collection<ONDEXConcept> getRoots(
    Graph<ONDEXConcept, ONDEXRelation> g) {
  Set<ONDEXConcept> roots = new HashSet<ONDEXConcept>();
  for (ONDEXConcept n : g.getVertices()) {
    // check selection of edge direction
    if (reversed && g.getSuccessorCount(n) == 0) {
      roots.add(n);
    }
    if (!reversed && g.getPredecessorCount(n) == 0) {
      roots.add(n);
    }
  }
  return roots;
}

代码示例来源：origin: net.sourceforge.ondex.apps/ovtk2-default

/**
 * A root is defined as having no ancestors.
 * 
 * @param g
 *            ONDEXJUNGGraph to get roots from
 * @return Collection<ONDEXConcept> containing all root nodes
 */
private Collection<ONDEXConcept> getRoots(
    Graph<ONDEXConcept, ONDEXRelation> g) {
  Set<ONDEXConcept> roots = new HashSet<ONDEXConcept>();
  for (ONDEXConcept n : g.getVertices()) {
    // check selection of edge direction
    if (reversed && g.getSuccessorCount(n) == 0) {
      roots.add(n);
    }
    if (!reversed && g.getPredecessorCount(n) == 0) {
      roots.add(n);
    }
  }
  return roots;
}