This question explores how graph algorithms can be applied to a graph with an unknown edge weight.
Graph W is shown in the following diagram. The vertices of W represent tourist attractions in a city. The weight of each edge represents the travel time, to the nearest minute, between two attractions. The route between A and F is currently being resurfaced and this has led to a variable travel time. For this reason, AF has an unknown travel time x minutes, where .

Write down the value of
p;
q;
r.
To find an upper bound for Daniel's travel time, the nearest neighbour algorithm is used, starting at vertex A.











