Revision as of 07:46, 2 May 2019 edit Alexey Muranov (talk \| contribs) Extended confirmed users 845 edits fix an unjustified and highly unbelievable claim by replacing "graph theory" (a wide area of mathematics or combinatorics) with "algorithmic graph theory" ← Previous edit		Revision as of 15:52, 26 May 2019 edit undo Ilstam (talk \| contribs) 1 edit fixed a function name Next edit →
Line 37: The runtime of <code>DijkstraSSSP</code> is <math>O(\|V\|^2)</math> as we expect the graph to be represented using an [[adjacency matrix]]. Therefore <code>~~DijkstraSSSP~~DijkstraAPSP</code> has a total sequential runtime of <math>O(\|V\|^3)</math>. ===Parallelization for up to \|''V''\| processors===

Parallel all-pairs shortest path algorithm: Difference between revisions