- Open the spreadsheet Applied Number Generator Formative 1. Using the sheet for question 2, copy the weights for the relevant edges onto your graph below. (You will see the random numbers change every time you click on the spreadsheet – this does not matter as you will be working with the values you insert below.)
- Use Dijkstra’s algorithm to find the shortest route from A to D on this network. Show all your working.
- State the route and distance.
You are required to work with weights that have been generated randomly for this question.
- Open the spreadsheet Applied Number Generator Formative 1. Using the sheet for question 3, copy the weights for the relevant edges onto your graph below. (You will see the random numbers change every time you click on the spreadsheet – this does not matter as you will be working with the values you insert below.)
- Starting and finishing at A, find the shortest route which travels at least once along every arc and answer the following:
- Determine which edges should be repeated
- State the length of the route
- State a possible route
You are required to work with weights that have been generated randomly for this question.
- Open the spreadsheet Applied Number Generator Formative 1. Using the sheet for question 4, copy the weights into the grid below. (You will see the random numbers change every time you click on the spreadsheet – this does not matter as you will be working with the values you insert below.)
- Starting at A, use Prim’s algorithm to find a minimum spanning tree for the table below.
| A 1 | B | C | D | E | F | |
| A | ||||||
| B | ||||||
| C | ||||||
| D | ||||||
| E | ||||||
| F |
- Draw the minimum spanning tree you found above.
