Question

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

A Longest Common Subsequence (LCS) Correct Answer Incorrect Answer
B Shortest Path Correct Answer Incorrect Answer
C Knapsack Problem Correct Answer Incorrect Answer
D Tower of Hanoi Correct Answer Incorrect Answer

Solution

Shortest Path

Practice Next

Relevant for Exams:

×
×