@Override public Set<N> successors(N node) { return network.successors(node); }
@Override public Set<N> predecessors(N node) { return delegate().successors(node); // transpose }
@Override public Set<N> successors(N node) { return delegate().successors(node); }
@Override public Set<N> successors(N node) { return delegate().successors(node); }
@Override public Set<N> predecessors(N node) { return delegate().successors(node); // transpose }
@Override public Set<N> predecessors(N node) { return delegate().successors(node); // transpose }
@Override public Set<N> successors(N node) { return delegate().successors(node); }
assertThat(asGraph.edges()).contains(EndpointPair.of(network, nodeU, nodeV)); assertThat(network.edgesConnecting(nodeU, nodeV)).contains(edge); assertThat(network.successors(nodeU)).contains(nodeV); assertThat(network.adjacentNodes(nodeU)).contains(nodeV); assertThat(network.outEdges(nodeU)).contains(edge); assertThat(network.successors(node)).isEqualTo(asGraph.successors(node)); } else { 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.successors(node).contains(otherNode)).isEqualTo(connected); assertThat(network.predecessors(otherNode).contains(node)).isEqualTo(connected); for (E edge : edgesConnecting) { assertTrue( network.predecessors(node).contains(adjacentNode) || network.successors(node).contains(adjacentNode)); assertTrue( !network.edgesConnecting(node, adjacentNode).isEmpty() assertThat(network.successors(predecessor)).contains(node); assertThat(network.edgesConnecting(predecessor, node)).isNotEmpty(); for (N successor : sanityCheckSet(network.successors(node))) { assertThat(network.predecessors(successor)).contains(node);
@Override public Set<N> successors(N node) { return delegate().successors(node); }
@Override public Set<N> predecessors(N node) { return delegate().successors(node); // transpose }
@Override public Set<N> successors(N node) { return network.successors(node); }
@Override public Set<N> predecessors(N node) { return delegate().successors(node); // transpose }
@Override public Set<N> successors(N node) { return delegate().successors(node); }
for (N w : g.successors(v)) { for (E e : g.edgesConnecting(v, w)) { if (!sd.distances.containsKey(w)) {
/** Updates the value for this node. */ @Override protected double update(N v) { collectDisappearingPotential(v); double v_auth = 0; for (N u : graph.predecessors(v)) { for (E e : graph.edgesConnecting(u, v)) { v_auth += (getCurrentValue(u).hub * getEdgeWeight(u, e).doubleValue()); } } double v_hub = 0; for (N w : graph.successors(v)) { for (E e : graph.edgesConnecting(v, w)) { v_hub += (getCurrentValue(w).authority * getEdgeWeight(w, e).doubleValue()); } } // modify total_input according to alpha if (alpha > 0) { v_auth = v_auth * (1 - alpha) + getNodePrior(v).authority * alpha; v_hub = v_hub * (1 - alpha) + getNodePrior(v).hub * alpha; } setOutputValue(v, new HITS.Scores(v_hub, v_auth)); return Math.max( Math.abs(getCurrentValue(v).hub - v_hub), Math.abs(getCurrentValue(v).authority - v_auth)); }
assertThat(asGraph.edges()).contains(EndpointPair.of(network, nodeU, nodeV)); assertThat(network.edgesConnecting(nodeU, nodeV)).contains(edge); assertThat(network.successors(nodeU)).contains(nodeV); assertThat(network.adjacentNodes(nodeU)).contains(nodeV); assertThat(network.outEdges(nodeU)).contains(edge); assertThat(network.successors(node)).isEqualTo(asGraph.successors(node)); } else { 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.successors(node).contains(otherNode)).isEqualTo(connected); assertThat(network.predecessors(otherNode).contains(node)).isEqualTo(connected); for (E edge : edgesConnecting) { assertTrue( network.predecessors(node).contains(adjacentNode) || network.successors(node).contains(adjacentNode)); assertTrue( !network.edgesConnecting(node, adjacentNode).isEmpty() assertThat(network.successors(predecessor)).contains(node); assertThat(network.edgesConnecting(predecessor, node)).isNotEmpty(); for (N successor : sanityCheckSet(network.successors(node))) { assertThat(network.predecessors(successor)).contains(node);