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 L to F in the image?

GraphsPath costs

Directed weighted graph. L to D has cost 1; D to F has cost 20; L to J has cost 2; J to F has cost 19. Only the shown edges exist.

Choose your answer

A21B45C22D20

More in Algorithms →

What is the cheapest directed route cost from L to F in the image? | SWE Maxx