Page 91 - NUMINO Challenge_C2
P. 91
Type 10-1 Shortest Paths in One-Way Streets
Find the number of shortest paths from point A to point B. (Note, you
can go only in the direction of the arrows.)
B
A
1 In order to go from point A to point B, you must pass through only the
roads with arrows in the direction of or . Mark on the roads that
you must not take.
B
A
2 The diagram can be redrawn leaving out the roads that you have marked
with in 1 . Find the number of shortest paths to each vertex and fill in
the blanks.
B
2
1234
A 111
3 Find the number of shortest paths from point A to point B.
88 NUMINO Challenge C2
Find the number of shortest paths from point A to point B. (Note, you
can go only in the direction of the arrows.)
B
A
1 In order to go from point A to point B, you must pass through only the
roads with arrows in the direction of or . Mark on the roads that
you must not take.
B
A
2 The diagram can be redrawn leaving out the roads that you have marked
with in 1 . Find the number of shortest paths to each vertex and fill in
the blanks.
B
2
1234
A 111
3 Find the number of shortest paths from point A to point B.
88 NUMINO Challenge C2
