Question

Which classic dynamic programming problem involves finding the shortest path in a weighted, directed graph?

A Longest Common Subsequence (LCS)
B Shortest Path
C Knapsack Problem
D Tower of Hanoi
E None of the mentioned
Practice Next

Hey! Ask a query