Questions Quizzes Daily challenge System design My attempts

Loading question…

← Question bank

Algorithms · Image-Based Question

Difficulty: Medium

What is the cheapest directed route cost from U to S in the image?

GraphsPath costs

Directed weighted graph. U to N has cost 19; N to S has cost 19; U to X has cost 2; X to S has cost 8. Only the shown edges exist.

Choose your answer

A10B9C23D11

More in Algorithms →

What is the cheapest directed route cost from U to S in the image? | SWE Maxx