Questions Quizzes Daily challenge System design My attempts

Loading question…

What is the cheapest directed route cost from A to K in the image? | SWE Maxx

← Question bank

Algorithms · Image-Based Question

Difficulty: Medium

What is the cheapest directed route cost from A to K in the image?

GraphsPath costs

Directed weighted graph. A to C has cost 8; C to K has cost 10; A to S has cost 14; S to K has cost 9. Only the shown edges exist.

Choose your answer

A19B39C18D17

More in Algorithms →