分析实验结果发现，不相交路径权值累积算法能有效计算网络成员关联度。

Disjoint paths weight accumulating algorithm is proved to be effective in correlation computing by analyzing the results of the experiments.

youdao

在没有精确的网络拓扑结构情况下，找出多条不相交路径是比较困难的。

The problem in multipath routing is that it is much more difficult to find multiple node-disjoint paths because of the lack of an accurate network topology.

youdao