Gigafibre in Lincolnshire and Yorkshire

To help consolidate your learning in this activity, use the the data in Gigafibre in Lincolnshire and Yorkshire distances – accessible version (PDF) to explain to a friend or family member how to find an optimal solution to GigaFibre’s network in Lincolnshire and Yorkshire.

A full text description of the image is available below:

Connecting Lincolnshire and Yorkshire – image full text description (PDF)

A reminder about Kruskal’s algorithm:

Kruskal’s algorithm

1. Take the edges of the graph and write them in a list ordering them by the number associated with each edge from lowest number to highest number. The lowest number should be at the top of the list an the highest number at the bottom of the list.
2. Starting from the top of the list, add the edge with the lowest number if by adding the edge it does not introduce a cycle into the graph. Cross the edge out if you have considered it.
3. Repeat step 2 until you have crossed all of the edges off of your list.

Next step

Have you answers ready to share with your fellow learners in the discussion.