Question
Which algorithm finds the shortest paths between all
pairs of vertices in a weighted graph?Solution
Floyd-Warshall computes shortest paths for all vertex pairs using dynamic programming.
If U walks 18m towards the west and then takes a left turn of 24m then, what is the shortest distance between Q and U finally?
What is the shortest distance between Sanju and Ankit?
What is the position of T with respect to W?
What is the total distance between Pole M and Pole R?
In a row of girls, Nikita is 25th from the left and Varsha is 33rd from the right. If they interchange their positions, then Nikit...
Starting from shop, Neha walks 12km towards west. He then turned right and walks 15km. Then he turned left and walks 8km to reach parlour. From there, h...
What is the shortest distance between point R and the point, which is 2m north of point P?
Point N is 5m north of point Z. Point Y is 7m west of point T. Point W is 6m west of point I, which is 12m north of point Y. Point P is 4m east of point...
What is the shortest distance between point M and point D?
If L is 11m east of F then L is in which direction of H?
