edu.uci.ics.jung.graph.Graph.getVertexCount()方法的使用及代码示例

x33g5p2x  于2022-01-20 转载在 其他  
字(3.9k)|赞(0)|评价(0)|浏览(126)

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

Graph.getVertexCount介绍

暂无

代码示例

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getVertexCount()
 */
@Override
public int getVertexCount() {
  return delegate.getVertexCount();
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getVertexCount()
 */
public int getVertexCount() {
  return delegate.getVertexCount();
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getVertexCount()
 */
public synchronized int getVertexCount() {
  return delegate.getVertexCount();
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getVertexCount()
 */
@Override
public synchronized int getVertexCount() {
  return delegate.getVertexCount();
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getVertexCount()
 */
public int getVertexCount() {
  return delegate.getVertexCount();
}

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

@Override
public int compare(Graph<?, ?> o1, Graph<?, ?> o2) {
  return o2.getVertexCount() - o1.getVertexCount();
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getVertexCount()
 */
@Override
public int getVertexCount() {
  return delegate.getVertexCount();
}

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

/**
 * @return The vertex count.
 */
public int getVertexCount()
{
  return delegate.getVertexCount();
}

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

public int getVertexCount() {
  return graph.getVertexCount();
}
public Collection<V> getVertices() {

代码示例来源:origin: com.projectdarkstar.server/sgs-server

/** {@inheritDoc} */
public long getNumberVertices() {
  return graph.getVertexCount();
}

代码示例来源:origin: org.reddwarfserver.server/sgs-server

/** {@inheritDoc} */
public long getNumberVertices() {
  return graph.getVertexCount();
}

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

@Override
public int getMaxProgress() {
  return getGraph().getVertexCount() + 1;
}

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

@Override
public int getMaxProgress() {
  return 2 * getGraph().getVertexCount();
}

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

@Override
public int getMaxProgress() {
  return 2 * getGraph().getVertexCount();
}

代码示例来源:origin: OpenNMS/opennms

private void doInit() {
  Graph<V,E> graph = getGraph();
  Dimension d = getSize();
  if(graph != null && d != null) {
    currentIteration = 0;
    temperature = d.getWidth() / 10;
    forceConstant =
        Math.sqrt(d.getHeight()
                * d.getWidth()
                / graph.getVertexCount());
    attraction_constant = attraction_multiplier * forceConstant;
    repulsion_constant = repulsion_multiplier * forceConstant;
  }
}

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

protected V findRoot(Graph<V, E> graph) {
  for (V v : graph.getVertices()) {
    if (graph.getInEdges(v).size() == 0) {
      return v;
    }
  }
  // if there is no obvious root, pick any vertex
  if (graph.getVertexCount() > 0) {
    return graph.getVertices().iterator().next();
  }
  // this graph has no vertices
  return null;
}

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

protected V findRoot(Graph<V,E> graph) {
  for(V v : graph.getVertices()) {
    if(graph.getInEdges(v).size() == 0) {
      return v;
    }
  }
  // if there is no obvious root, pick any vertex
  if(graph.getVertexCount() > 0) {
    return graph.getVertices().iterator().next();
  }
  // this graph has no vertices
  return null;
}

代码示例来源:origin: org.opendaylight.controller.thirdparty/net.sf.jung2

protected V findRoot(Graph<V,E> graph) {
  for(V v : graph.getVertices()) {
    if(graph.getInEdges(v).size() == 0) {
      return v;
    }
  }
  // if there is no obvious root, pick any vertex
  if(graph.getVertexCount() > 0) {
    return graph.getVertices().iterator().next();
  }
  // this graph has no vertices
  return null;
}

代码示例来源:origin: OpenNMS/opennms

@Override
  public boolean done() {
    return getGraph().getVertexCount() > 0 ? super.done() : true;
  }
}

代码示例来源:origin: org.opennms.features.topology/org.opennms.features.topology.app

@Override
  public boolean done() {
    return getGraph().getVertexCount() > 0 ? super.done() : true;
  }
}

相关文章