Tim Gan Math
Sign up free

Shortest Path Grid Problem with Constraints

Shortest Path Grid Problem with Constraints

A network of shops (indicated by dots) connected by streets (indicated by lines) is shown in the figure below. How many routes with the shortest distance are available

  1. starting from \(A\) and ending at \(B\)?
  2. Starting from \(A\), ending at \(B\) and passing through \(C\)?

Video Solution:

Video Solution

Video solution locked

A free account saves your progress; this video needs a course plan.

Create free accountSign inGet the H2 Math course · from S$39.98/mo

Solution:

Solution locked

680+ questions here come with free worked solutions. A free account saves your questions and progress; this one needs a course plan.

Create free accountSign inGet the H2 Math course · from S$39.98/moH2 Math tuition

Create a free account to practise similar questions.

Create free accountSign inGet the H2 Math course · from S$39.98/moH2 Math tuition
Answer:(a) \(210\) (b) \(90\)

Need help? Join our JC Math tuition classes.

Learn more