@Override public int inDegree(N node) { return delegate().outDegree(node); // transpose }
@Override public int outDegree(N node) { return delegate().outDegree(node); }
@Override public int inDegree(N node) { return delegate().outDegree(node); // transpose }
@Override public int outDegree(N node) { return delegate().outDegree(node); }
@Override public int outDegree(N node) { return delegate().outDegree(node); }
@Override public int inDegree(N node) { return delegate().outDegree(node); // transpose }
.isEqualTo(network.inDegree(node) + network.outDegree(node)); assertThat(network.inEdges(node)).hasSize(network.inDegree(node)); assertThat(network.outEdges(node)).hasSize(network.outDegree(node)); } else { assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(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));
assertThat(directedGraph.inDegree(node)).isSameAs(transpose.outDegree(node)); assertThat(directedGraph.outDegree(node)).isSameAs(transpose.inDegree(node));
@Override public int outDegreeOf(V vertex) { return network.outDegree(vertex); }
@Override public int inDegree(N node) { return delegate().outDegree(node); // transpose }
@Override public int outDegree(N node) { return delegate().outDegree(node); }
@Override public int outDegree(N node) { return delegate().outDegree(node); }
@Override public int inDegree(N node) { return delegate().outDegree(node); // transpose }
/** * Collects the "disappearing potential" associated with nodes that have no outgoing edges. Nodes * that have no outgoing edges do not directly contribute to the scores of other nodes. These * values are collected at each step and then distributed across all nodes as a part of the * normalization process. */ @Override protected void collectDisappearingPotential(N v) { if (graph.outDegree(v) == 0) { Preconditions.checkState(isDisconnectedGraphOK(), "Outdegree of " + v + " must be > 0"); disappearing_potential += getCurrentValue(v); } } }
public NodeShapeSizeAspect(Network<N, E> graphIn, Function<N, Double> voltagesIn) { this.graph = graphIn; this.voltages = voltagesIn; setSizeTransformer(n -> scale ? (int) (voltages.apply(n) * 15) + 10 : 10); setAspectRatioTransformer( n -> stretch ? (float) (graph.inDegree(n) + 1) / (graph.outDegree(n) + 1) : 1.0f); }
/** * Collects the "disappearing potential" associated with nodes that have either no incoming edges, * no outgoing edges, or both. Nodes that have no incoming edges do not directly contribute to the * hub scores of other nodes; similarly, nodes that have no outgoing edges do not directly * contribute to the authority scores of other nodes. These values are collected at each step and * then distributed across all nodes as a part of the normalization process. (This process is not * required for, and does not affect, the 'sum-of-squares'-style normalization.) */ @Override protected void collectDisappearingPotential(N v) { if (graph.outDegree(v) == 0) { Preconditions.checkArgument(isDisconnectedGraphOK(), "Outdegree of " + v + " must be > 0"); disappearing_potential.hub += getCurrentValue(v).authority; } if (graph.inDegree(v) == 0) { Preconditions.checkArgument(isDisconnectedGraphOK(), "Indegree of " + v + " must be > 0"); disappearing_potential.authority += getCurrentValue(v).hub; } } }
public Double apply(VEPair<N, E> ve_pair) { E e = ve_pair.getE(); N v = ve_pair.getV(); return graph.isDirected() ? 1.0 / graph.outDegree(graph.incidentNodes(e).source()) : 1.0 / graph.degree(v); } }
.isEqualTo(network.inDegree(node) + network.outDegree(node)); assertThat(network.inEdges(node)).hasSize(network.inDegree(node)); assertThat(network.outEdges(node)).hasSize(network.outDegree(node)); } else { assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(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));
assertThat(directedGraph.inDegree(node)).isSameAs(transpose.outDegree(node)); assertThat(directedGraph.outDegree(node)).isSameAs(transpose.inDegree(node));