All pairs shortest paths

[@swagatachatterjee1272]

best lectures of algorithm I have ever listened.

[@PomegranateAmazing79]

Value [4][5] in W0 is 3 not value[4][3]

[@PomegranateAmazing79]

4 and 3 are not directly connected so the value should be infinity

[@swagatachatterjee1272]

yeah. this is a printing mistake.

[@vasudev7828]

thanks for the affirmation

[@yiyu9519]

what does " all pairs shortest paths" mean

[@achivgupta6255]

It means that we are finding the shortest path between any 2 vertices in the graph , kind of like a dynamic solution.

[@gpprudhvi]

Single source shortest path repeated on all vertices as sources. It can be thought as the shortest way to reach every other vertex from every vertex