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

Graph.getIncidentVertices介绍

暂无

代码示例

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getIncidentVertices(java.lang.Object)
 */
@Override
public synchronized Collection<V> getIncidentVertices(E edge) {
  return delegate.getIncidentVertices(edge);
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getIncidentVertices(java.lang.Object)
 */
public Collection<V> getIncidentVertices(E edge) {
  return delegate.getIncidentVertices(edge);
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getIncidentVertices(java.lang.Object)
 */
@Override
public Collection<V> getIncidentVertices(E edge) {
  return delegate.getIncidentVertices(edge);
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getIncidentVertices(java.lang.Object)
 */
public Collection<V> getIncidentVertices(E edge) {
  return delegate.getIncidentVertices(edge);
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getIncidentVertices(java.lang.Object)
 */
@Override
public Collection<V> getIncidentVertices(E edge) {
  return delegate.getIncidentVertices(edge);
}

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

/**
 * @see edu.uci.ics.jung.graph.Hypergraph#getIncidentVertices(java.lang.Object)
 */
public synchronized Collection<V> getIncidentVertices(E edge) {
  return delegate.getIncidentVertices(edge);
}

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

public Collection<V> getIncidentVertices(E edge) {
  return graph.getIncidentVertices(edge);
}
public Collection<E> getInEdges(V vertex) {

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

public Collection getIncidentVertices(Object edge)
{
  return delegate.getIncidentVertices(edge);
}

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

protected V getAVertex(E e) {
  
  return getGraph().getIncidentVertices(e).iterator().next();
}

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

@SuppressWarnings("unchecked")
public Graph<V,E> apply(Graph<V,E> g)
{
  Graph<V, E> filtered;
  try
  {
    filtered = g.getClass().newInstance();
  }
  catch (InstantiationException e)
  {
    throw new RuntimeException("Unable to create copy of existing graph: ", e);
  }
  catch (IllegalAccessException e)
  {
    throw new RuntimeException("Unable to create copy of existing graph: ", e);
  }
  for (V v : g.getVertices())
    filtered.addVertex(v);
  
  for (E e : g.getEdges())
  {
    if (edge_pred.apply(e))
      filtered.addEdge(e, g.getIncidentVertices(e));
  }
  
  return filtered;
}

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

Collection<V> incident = original.getIncidentVertices(e);
Collection<CV> collapsed_vertices = new HashSet<CV>();
Map<V, Set<V>> vertex_partitions = partitioning.getVertexToPartitionMap();

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

Collection<V> incident = g.getIncidentVertices(e);
if (filtered_vertices.containsAll(incident))
  filtered.addEdge(e, incident);

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

@SuppressWarnings("unchecked")
public Graph<V,E> transform(Graph<V,E> g)
{
  Graph<V, E> filtered;
  try
  {
    filtered = g.getClass().newInstance();
  }
  catch (InstantiationException e)
  {
    throw new RuntimeException("Unable to create copy of existing graph: ", e);
  }
  catch (IllegalAccessException e)
  {
    throw new RuntimeException("Unable to create copy of existing graph: ", e);
  }
  for (V v : g.getVertices())
    filtered.addVertex(v);
  
  for (E e : g.getEdges())
  {
    if (edge_pred.evaluate(e))
      filtered.addEdge(e, g.getIncidentVertices(e));
  }
  
  return filtered;
}

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

Collection<V> incident = g.getIncidentVertices(e);
if (filtered_vertices.containsAll(incident))
  filtered.addEdge(e, incident);

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

Collection<V> vertices = graph.getIncidentVertices(e);
Iterator<V> vertexIterator = vertices.iterator();
V v1 = vertexIterator.next();

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

Collection<V> vertices = graph.getIncidentVertices(e);

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

Collection<V> incident = original.getIncidentVertices(e);
Collection<CV> collapsed_vertices = new HashSet<CV>();
Map<V, Set<V>> vertex_partitions = partitioning.getVertexToPartitionMap();

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

@Override
public Graph<V, E> transform(Graph<V, E> g) {
  Graph<V, E> filtered;
  try {
    filtered = g.newInstance();
  } catch (Exception e) {
    throw new RuntimeException(
        "Unable to create copy of existing graph: ", e);
  }
  for (V v : g.getVertices()) {
    filtered.addVertex(v);
  }
  for (E e : g.getEdges()) {
    if (edge_pred.evaluate(e)) {
      filtered.addEdge(e, g.getIncidentVertices(e));
    }
  }
  return filtered;
}

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

Collection<V> incident = original.getIncidentVertices(e);
Collection<CV> collapsed_vertices = new HashSet<CV>();
Map<V, Set<V>> vertex_partitions = partitioning

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

@Override
public Graph<V, E> transform(Graph<V, E> g) {
  Graph<V, E> filtered;
  try {
    filtered = g.newInstance();
  } catch (Exception e) {
    throw new RuntimeException(
        "Unable to create copy of existing graph: ", e);
  }
  for (V v : g.getVertices()) {
    if (vertex_pred.evaluate(v)) {
      filtered.addVertex(v);
    }
  }
  Collection<V> filtered_vertices = filtered.getVertices();
  for (E e : g.getEdges()) {
    Collection<V> incident = g.getIncidentVertices(e);
    if (filtered_vertices.containsAll(incident)) {
      filtered.addEdge(e, incident);
    }
  }
  return filtered;
}