擅长:python、mysql、java
<p>它看起来像个虫子。你知道吗</p>
<p>这是我的猜测。这个bug似乎来自<a href="https://github.com/networkx/networkx/blob/882e5e3bd1ea7827c97f087e2ecb941c5f0aca55/networkx/algorithms/centrality/betweenness_subset.py#L231" rel="nofollow noreferrer">_rescale</a>函数。这里,如果图形是间接的,则计算值乘以0.5。你知道吗</p>
<p>因为在一般的<code>betweenness_centrality</code>中,对于<code>betweenness_centrality_sub</code>,节点被考虑两次(最短路径被计算<a href="https://github.com/networkx/networkx/blob/882e5e3bd1ea7827c97f087e2ecb941c5f0aca55/networkx/algorithms/centrality/betweenness.py#L116" rel="nofollow noreferrer">for each node in the graph</a>),这是没有必要的,因为最短路径只被计算<a href="https://github.com/networkx/networkx/blob/882e5e3bd1ea7827c97f087e2ecb941c5f0aca55/networkx/algorithms/centrality/betweenness_subset.py#L92" rel="nofollow noreferrer">for the <em>sources</em> nodes</a>。你知道吗</p>
<p>示例:</p>
<pre><code>nx.betweenness_centrality_subset(G,[2,6],[2,6])
# {1: 0.0, 5: 1.0, 2: 0.0, 3: 0.0, 4: 0.5, 6: 0.0, 7: 0.5}
</code></pre>
<p>所以,如果我的猜测是对的,你只需要将计算结果乘以2。你知道吗</p>