Exercise 13E - Finding the shortest path

Using Dijkstra’s algorithm or otherwise to find the shortest path from node 3 to node 0

• 3-1-0

• 3-2-0

• 3-2-1-0

• 3-1-2-0

Using Dijkstra’s algorithm or otherwise to find the shortest path from E to C

• E-B-C

• E-D-C

• E-B-A-C

• E-B-D-C

Tags

CCSS.8.EE.C.8C

Using Dijkstra’s algorithm or otherwise to find the shortest path from a to z

• a-c-b-d-e-z

• a-b-d-e-z

• a-c-b-d-z

• a-b-d-z

Tags

CCSS.8.EE.C.8C

Using Dijkstra’s algorithm or otherwise to find the shortest paths from S to d.

• S-a-b-d

• S-c-a-b-d

• S-c-d

• S-c-b-d

Which of the following paths has a total weight of 17

• A-C-E-F

• A-C-B-D-F

• A-C-E-D-F

• A-B-E-F

The total weight travelling this path A-B-D-F-C is

• 12

• 13

• 15

• 11

Using Dijkstra’s algorithm or otherwise to find the shortest path from A to F

• A-B-C-D-F

• A-B-D-E-F

• A-B-D-F

• A-B-E-F

Tags

CCSS.8.EE.C.8C

Using Dijkstra’s algorithm or otherwise to find the shortest path from S to C

• S-A-C

• S-B-D-C

• S-A-D-C

• S-B-D-A-C

Tags

CCSS.8.EE.C.8C