0 votes 0 votes Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED) Algorithms made-easy-test-series algorithms dynamic-programming + – adityaaswal asked Nov 30, 2018 • edited Mar 4, 2019 by akash.dinkar12 adityaaswal 537 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Hemanth_13 commented Nov 30, 2018 reply Follow Share It's Floyd warshell all pair shortest path 1 votes 1 votes adityaaswal commented Dec 1, 2018 reply Follow Share what is use of k here ? 0 votes 0 votes vupadhayayx86 commented Nov 30, 2019 reply Follow Share @arjun @srestha @Hemanth_13 Can someone explain significance of k here in this question? 0 votes 0 votes srestha commented Nov 30, 2019 reply Follow Share Say there is no edge from i to j, then find a path from kto j and then distance from i to k 0 votes 0 votes Please log in or register to add a comment.