解决所有点对之间最快路问题的关键是产生有效解的等价集合。
The key idea to solve all-pairs quickest path problem is to generate an equivalent set of efficient solutions.
您使用 foreach() 循环来迭代通过得到的对象集合，如 清单 3 中所示，以产生等价于 清单 4 中的输出。
You use a foreach() loop to iterate over the resulting object collection, as in Listing 3, to produce output equivalent to that of Listing 4.
实施的约束集合（的传递封包）所定义的等价关系表明：N L = N L
The equivalence relation defined by the (transitive closure of the) set of imposed constraints implies N L = N L
应用推荐