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

Network.incidentEdges介绍

[英]Returns the edges whose #incidentNodes(Object) in this network include node.
[中]返回其#incidentNodes（对象）在此网络中包含节点的边。

代码示例

代码示例来源：origin: google/guava

@Override
public Set<E> incidentEdges(N node) {
 return delegate().incidentEdges(node);
}

代码示例来源：origin: google/guava

@Override
public Set<E> incidentEdges(N node) {
 return network.incidentEdges(node);
}

代码示例来源：origin: google/j2objc

@Override
public Set<E> incidentEdges(N node) {
 return delegate().incidentEdges(node);
}

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

@Override
public Set<E> incidentEdges(N node) {
 return delegate().incidentEdges(node);
}

代码示例来源：origin: google/guava

private static <N, E> NetworkConnections<N, E> connectionsOf(Network<N, E> network, N node) {
 if (network.isDirected()) {
  Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network));
  Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network));
  int selfLoopCount = network.edgesConnecting(node, node).size();
  return network.allowsParallelEdges()
    ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount)
    : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount);
 } else {
  Map<E, N> incidentEdgeMap =
    Maps.asMap(network.incidentEdges(node), adjacentNodeFn(network, node));
  return network.allowsParallelEdges()
    ? UndirectedMultiNetworkConnections.ofImmutable(incidentEdgeMap)
    : UndirectedNetworkConnections.ofImmutable(incidentEdgeMap);
 }
}

代码示例来源：origin: google/j2objc

private static <N, E> NetworkConnections<N, E> connectionsOf(Network<N, E> network, N node) {
 if (network.isDirected()) {
  Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network));
  Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network));
  int selfLoopCount = network.edgesConnecting(node, node).size();
  return network.allowsParallelEdges()
    ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount)
    : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount);
 } else {
  Map<E, N> incidentEdgeMap =
    Maps.asMap(network.incidentEdges(node), adjacentNodeFn(network, node));
  return network.allowsParallelEdges()
    ? UndirectedMultiNetworkConnections.ofImmutable(incidentEdgeMap)
    : UndirectedNetworkConnections.ofImmutable(incidentEdgeMap);
 }
}

代码示例来源：origin: google/guava

assertThat(network.adjacentNodes(nodeU)).contains(nodeV);
assertThat(network.outEdges(nodeU)).contains(edge);
assertThat(network.incidentEdges(nodeU)).contains(edge);
assertThat(network.predecessors(nodeV)).contains(nodeU);
assertThat(network.adjacentNodes(nodeV)).contains(nodeU);
assertThat(network.inEdges(nodeV)).contains(edge);
assertThat(network.incidentEdges(nodeV)).contains(edge);
 for (E adjacentEdge : network.incidentEdges(incidentNode)) {
  assertTrue(
    edge.equals(adjacentEdge) || network.adjacentEdges(edge).contains(adjacentEdge));
assertThat(network.incidentEdges(node).size() + selfLoopCount)
  .isEqualTo(network.degree(node));
 assertThat(network.incidentEdges(node).size() + selfLoopCount)
   .isEqualTo(network.inDegree(node) + network.outDegree(node));
 assertThat(network.inEdges(node)).hasSize(network.inDegree(node));
 assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node));
 assertThat(network.successors(node)).isEqualTo(network.adjacentNodes(node));
 assertThat(network.inEdges(node)).isEqualTo(network.incidentEdges(node));
 assertThat(network.outEdges(node)).isEqualTo(network.incidentEdges(node));
 assertThat(network.inDegree(node)).isEqualTo(network.degree(node));
 assertThat(network.outDegree(node)).isEqualTo(network.degree(node));
for (E incidentEdge : sanityCheckSet(network.incidentEdges(node))) {
 assertTrue(
   network.inEdges(node).contains(incidentEdge)

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

private static <N, E> NetworkConnections<N, E> connectionsOf(Network<N, E> network, N node) {
 if (network.isDirected()) {
  Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network));
  Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network));
  int selfLoopCount = network.edgesConnecting(node, node).size();
  return network.allowsParallelEdges()
    ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount)
    : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount);
 } else {
  Map<E, N> incidentEdgeMap =
    Maps.asMap(network.incidentEdges(node), adjacentNodeFn(network, node));
  return network.allowsParallelEdges()
    ? UndirectedMultiNetworkConnections.ofImmutable(incidentEdgeMap)
    : UndirectedNetworkConnections.ofImmutable(incidentEdgeMap);
 }
}

代码示例来源：origin: com.io7m.jgrapht/jgrapht-guava

@Override
public Set<E> edgesOf(V vertex)
{
  return network.incidentEdges(vertex);
}

代码示例来源：origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

@Override
public Set<E> incidentEdges(N node) {
 return delegate().incidentEdges(node);
}

代码示例来源：origin: org.jboss.eap/wildfly-client-all

@Override
public Set<E> incidentEdges(N node) {
 return delegate().incidentEdges(node);
}

代码示例来源：origin: com.google.guava/guava-tests

@Override
public Set<E> incidentEdges(N node) {
 return network.incidentEdges(node);
}

代码示例来源：origin: jrtom/jung

@Override
public void layoutChanged(LayoutEvent<N> evt) {
 // need to take care of edge changes
 N node = evt.getNode();
 Point p = evt.getLocation();
 if (visualizationModel.getNetwork().nodes().contains(node)) {
  Set<E> edges = visualizationModel.getNetwork().incidentEdges(node);
  for (E edge : edges) {
   update(edge, p);
  }
 }
}

代码示例来源：origin: jrtom/jung

@Override
public void layoutChanged(LayoutNetworkEvent<N> evt) {
 N node = evt.getNode();
 Point p = evt.getLocation();
 if (visualizationModel.getNetwork().nodes().contains(node)) {
  Set<E> edges = visualizationModel.getNetwork().incidentEdges(node);
  for (E edge : edges) {
   update(edge, p);
  }
 }
}

代码示例来源：origin: jrtom/jung

public Network getClusterGraph(Network inGraph, Collection picked) {
  MutableNetwork clusterGraph = graphBuilder.build();
  for (Object node : picked) {
   clusterGraph.addNode(node);
   Set edges = inGraph.incidentEdges(node);
   for (Object edge : edges) {
    Object u = inGraph.incidentNodes(edge).nodeU();
    Object v = inGraph.incidentNodes(edge).nodeV();
    if (picked.contains(u) && picked.contains(v)) {
     clusterGraph.addEdge(u, v, edge);
    }
   }
  }
  return clusterGraph;
 }
}

代码示例来源：origin: jrtom/jung

Object nodeV = pickedIter.next();
Network graph = vv.getModel().getNetwork();
Collection edges = new HashSet(graph.incidentEdges(nodeU));
edges.retainAll(graph.incidentEdges(nodeV));
exclusions.addAll(edges);
vv.repaint();
Object nodeV = pickedIter.next();
Network graph = vv.getModel().getNetwork();
Collection edges = new HashSet(graph.incidentEdges(nodeU));
edges.retainAll(graph.incidentEdges(nodeV));
exclusions.removeAll(edges);
vv.repaint();

代码示例来源：origin: jrtom/jung

for (String node : picked) {
 subGraph.addNode(node);
 for (Number edge : graph.incidentEdges(node)) {
  EndpointPair<String> endpoints = graph.incidentNodes(edge);
  String nodeU = endpoints.nodeU();

代码示例来源：origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

private static <N, E> NetworkConnections<N, E> connectionsOf(Network<N, E> network, N node) {
 if (network.isDirected()) {
  Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network));
  Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network));
  int selfLoopCount = network.edgesConnecting(node, node).size();
  return network.allowsParallelEdges()
    ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount)
    : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount);
 } else {
  Map<E, N> incidentEdgeMap =
    Maps.asMap(network.incidentEdges(node), adjacentNodeFn(network, node));
  return network.allowsParallelEdges()
    ? UndirectedMultiNetworkConnections.ofImmutable(incidentEdgeMap)
    : UndirectedNetworkConnections.ofImmutable(incidentEdgeMap);
 }
}

代码示例来源：origin: org.jboss.eap/wildfly-client-all

private static <N, E> NetworkConnections<N, E> connectionsOf(Network<N, E> network, N node) {
 if (network.isDirected()) {
  Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network));
  Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network));
  int selfLoopCount = network.edgesConnecting(node, node).size();
  return network.allowsParallelEdges()
    ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount)
    : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount);
 } else {
  Map<E, N> incidentEdgeMap =
    Maps.asMap(network.incidentEdges(node), adjacentNodeFn(network, node));
  return network.allowsParallelEdges()
    ? UndirectedMultiNetworkConnections.ofImmutable(incidentEdgeMap)
    : UndirectedNetworkConnections.ofImmutable(incidentEdgeMap);
 }
}

代码示例来源：origin: com.google.guava/guava-tests

assertThat(network.adjacentNodes(nodeU)).contains(nodeV);
assertThat(network.outEdges(nodeU)).contains(edge);
assertThat(network.incidentEdges(nodeU)).contains(edge);
assertThat(network.predecessors(nodeV)).contains(nodeU);
assertThat(network.adjacentNodes(nodeV)).contains(nodeU);
assertThat(network.inEdges(nodeV)).contains(edge);
assertThat(network.incidentEdges(nodeV)).contains(edge);
 for (E adjacentEdge : network.incidentEdges(incidentNode)) {
  assertTrue(
    edge.equals(adjacentEdge) || network.adjacentEdges(edge).contains(adjacentEdge));
assertThat(network.incidentEdges(node).size() + selfLoopCount)
  .isEqualTo(network.degree(node));
 assertThat(network.incidentEdges(node).size() + selfLoopCount)
   .isEqualTo(network.inDegree(node) + network.outDegree(node));
 assertThat(network.inEdges(node)).hasSize(network.inDegree(node));
 assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node));
 assertThat(network.successors(node)).isEqualTo(network.adjacentNodes(node));
 assertThat(network.inEdges(node)).isEqualTo(network.incidentEdges(node));
 assertThat(network.outEdges(node)).isEqualTo(network.incidentEdges(node));
 assertThat(network.inDegree(node)).isEqualTo(network.degree(node));
 assertThat(network.outDegree(node)).isEqualTo(network.degree(node));
for (E incidentEdge : sanityCheckSet(network.incidentEdges(node))) {
 assertTrue(
   network.inEdges(node).contains(incidentEdge)