Q14MCQ1 mark, −0.33The Floyd-Warshall algorithm for all-pair shortest paths computation is based on(A)Greedy paradigm.(B)Divide-and-conquer paradigm.(C)Dynamic Programming paradigm.(D)Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.Sign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google