@Override public Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); }
@Override public Set<E> incidentEdges(N node) { return network.incidentEdges(node); }
@Override public Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); }
@Override public Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); }
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); } }
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); } }
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)
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); } }
@Override public Set<E> edgesOf(V vertex) { return network.incidentEdges(vertex); }
@Override public Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); }
@Override public Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); }
@Override public Set<E> incidentEdges(N node) { return network.incidentEdges(node); }
@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); } } }
@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); } } }
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; } }
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();
for (String node : picked) { subGraph.addNode(node); for (Number edge : graph.incidentEdges(node)) { EndpointPair<String> endpoints = graph.incidentNodes(edge); String nodeU = endpoints.nodeU();
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); } }
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); } }
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)