modify current algorithm - APSP

Question

I have the below APSP algorithm:

This computes the shortest path. The length of the path is the sum of weights of edges of path.

How can i modify the above algorithm in order to compute the shortest path where length is the weight of the heaviest edge on this path.

Any help would be great!!!

this looks more similar to widest path, except, as pointed out by Yevgeniy, it should use max instead of min. — Marat
– Marat, Commented Dec 22, 2021 at 17:38

Yevhenii Kosmak · Accepted Answer · 2021-12-22 08:06:21Z

2

On 7th line instead of

cost = D[i, k] + D[k, j]

you just should put

cost = Max(D[i, k], D[k, j])

answered Dec 22, 2021 at 8:06

Yevhenii Kosmak

3,8802 gold badges13 silver badges29 bronze badges

Sign up to request clarification or add additional context in comments.

1 Answer 1