Questions Quizzes Daily challenge System design My attempts

Loading question…

What is the cheapest directed route cost from N to E in the image? | SWE Maxx

← Question bank

Algorithms · Image-Based Question

Difficulty: Medium

What is the cheapest directed route cost from N to E in the image?

GraphsPath costs

Directed weighted graph. N to W has cost 1; W to E has cost 25; N to G has cost 12; G to E has cost 18. Only the shown edges exist.

Choose your answer

A55B27C26D25

More in Algorithms →