Parallel all-pairs shortest path algorithm: Difference between revisions

Revision as of 17:23, 2 April 2018

Revision as of 17:25, 2 April 2018

Line 115:

4 '''for''' ''i'' := 1 '''to''' ''n'' '''do'''

5 '''for''' ''j'' := 1 '''to''' ''n'' '''do'''

6 <math>d^{(k)}_{i,j} := \min(d^{(k-1)}_{i,j}, d^{(k-1)}_{i,k} + d^{(k-1)}_{k,j}) </math>

7 }

Line 170:

: <math>T = O\left( \frac{n^3} p\right) + O(n)</math>

== References ==

{{reflist}}