Questions Quizzes Daily challenge System design My attempts

Loading question…

What is the cheapest directed route cost from P to D in the image? | SWE Maxx

← Question bank

Algorithms · Image-Based Question

Difficulty: Medium

What is the cheapest directed route cost from P to D in the image?

GraphsPath costs

Directed weighted graph. P to M has cost 6; M to D has cost 16; P to N has cost 3; N to D has cost 2. Only the shown edges exist.

Choose your answer

A5B4C13D6

More in Algorithms →