OCR MEI D1 2012 June — Question 1

Exam BoardOCR MEI
ModuleD1 (Decision Mathematics 1)
Year2012
SessionJune
TopicShortest Path
1 The table defines a network in which the numbers represent lengths.
ABCDEFG
A-38-5--
B3-4---6
C84-11-2
D--1---5
E5-1--4-
F----4-1
G-625-1-
  1. Draw the network.
  2. Use Dijkstra's algorithm to find the shortest route from A to G . Give the route and its length.
This paper (6 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6