1 / 62

Networks & Minimum Spanning Trees

Networks & Minimum Spanning Trees. Networks and Minimum Spanning Trees. Cambridge is installing fibre optic cabling between the surrounding villages. All the villages must be connected. We need to minimise the amount of cable that is used. 3 miles. 3 miles. Impington. Milton. Girton.

saman
Download Presentation

Networks & Minimum Spanning Trees

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Networks & Minimum Spanning Trees

  2. Networks and Minimum Spanning Trees • Cambridge is installing fibre optic cabling between the surrounding villages. • All the villages must be connected. • We need to minimise the amount of cable that is used.

  3. 3 miles 3 miles Impington Milton Girton 6 miles 5 miles 5 miles 6 miles 4 miles Bottisham 7 miles 4 miles Coton Cambridge 6 miles 3 miles 3 miles 6 miles Fulbourn Grantchester 5 miles 4 miles 5 miles Great Shelford

  4. 3 miles 3 miles Impington Milton Girton 6 miles 5 miles 5 miles 6 miles 4 miles Bottisham 7 miles 4 miles Coton Cambridge 6 miles 3 miles 3 miles 6 miles Fulbourn Grantchester 5 miles 4 miles 5 miles Great Shelford

  5. 3 3 I M T 6 5 5 4 6 B 7 4 O C 6 3 3 6 F G 5 4 5 S This network can now be used to model our situation.

  6. Networks and Minimum Spanning Trees • A network is a type of graph used in Decision Maths. • Points (called nodes or vertices) are connected by lines (called arcs or edges). • The lines (edges) have values attached to them, these may represent a cost or a distance.

  7. Networks and Minimum Spanning Trees • A minimum spanning tree is a section of the network. • All points (nodes) must be included but you should not have any cycles. • A cycle links points together in a closed ring. • The minimum spanning tree links the points (nodes) using the lines (edges) that have the smallest values. Cycle ✖ ✔

  8. Networks and Minimum Spanning Trees • Algorithms have been created to help us decide which edges should be used to create the minimum spanning tree. • We are going to use Kruskal’s Algorithm.

  9. Kruskal's’s Algorithm Write down all the edges in size order Select the shortest edge in a network Select the next shortest edge which does not create a cycle Repeat step 3 until all vertices have been connected

  10. TI – 3 IM – 3 GC – 3 GO – 3 MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  11. TI – 3 ✔ IM – 3 GC – 3 GO – 3 MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  12. TI – 3 ✔ IM – 3 GC – 3 GO – 3 MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  13. TI – 3 ✔ IM – 3 ✔ GC – 3 GO – 3 MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  14. TI – 3 ✔ IM – 3 ✔ GC – 3 GO – 3 MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  15. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  16. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  17. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  18. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  19. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  20. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  21. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  22. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  23. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  24. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  25. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  26. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  27. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 ✔ TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  28. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 ✔ TO – 6 CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  29. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 ✔ TO – 6 ✖ (cycle) CF – 6 BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  30. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 ✔ TO – 6 ✖ (cycle) CF – 6 ✖ (cycle) BF – 6 BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  31. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 ✔ TO – 6 ✖ (cycle) CF – 6 ✖ (cycle) BF – 6 ✔ BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  32. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 ✔ TO – 6 ✖ (cycle) CF – 6 ✖ (cycle) BF – 6 ✔ BM – 6 CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  33. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 ✔ TO – 6 ✖ (cycle) CF – 6 ✖ (cycle) BF – 6 ✔ BM – 6 ✖ (cycle) CB – 7 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  34. TI – 3 ✔ IM – 3 ✔ GC – 3 ✔ GO – 3 ✔ MC – 4 ✔ SG – 4 ✔ OC – 4 ✖ (cycle) IC – 5 ✖ (cycle) TC – 5 ✖ (cycle) SC – 5 ✖ (cycle) SF – 5 ✔ TO – 6 ✖ (cycle) CF – 6 ✖ (cycle) BF – 6 ✔ BM – 6 ✖ (cycle) CB – 7 ✖ (cycle) 3 3 I M T 6 5 5 4 6 B 4 7 O C 6 3 3 6 F G 5 5 4 S

  35. 3 3 I M T 4 B O C 6 The minimum spanning tree contains only the edges we have selected. The total weight of the tree comes from the summation of our distances. 3 + 3 + 4 + 3 + 3 + 4 + 5 + 6 = 31 So, the city needs a total of 31 km in fibre optic cabling! 3 3 F G 5 4 S

  36. Tunneling Students • In an attempt to get out of the rain and away from the tourists, the students of the University of Cambridge are setting up some underground tunnels between the university buildings! • Suggest a network of tunnels they could use, minimising the amount of tunneling required.

  37. J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  38. J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  39. KPb – 0.1 KQ – 0.2 KT – 0.2 TSj – 0.2 PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  40. KPb – 0.1 ✔ KQ – 0.2 KT – 0.2 TSj – 0.2 PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  41. KPb– 0.1 ✔ KQ – 0.2 KT – 0.2 TSj – 0.2 PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  42. KPb – 0.1 ✔ KQ – 0.2 ✔ KT – 0.2 TSj – 0.2 PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  43. KPb – 0.1 ✔ KQ – 0.2 ✔ KT – 0.2 TSj – 0.2 PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  44. KPb – 0.1 ✔ KQ – 0.2 ✔ KT – 0.2 ✔ TSj – 0.2 PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  45. KPb – 0.1 ✔ KQ – 0.2 ✔ KT – 0.2 ✔ TSj – 0.2 PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  46. KPb – 0.1 ✔ KQ – 0.2 ✔ KT – 0.2 ✔ TSj – 0.2 ✔ PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  47. KPb – 0.1 ✔ KQ – 0.2 ✔ KT – 0.2 ✔ TSj– 0.2 ✔ PbE – 0.3 TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

  48. KPb – 0.1 ✔ KQ – 0.2 ✔ KT – 0.2 ✔ TSj – 0.2 ✔ PbE – 0.3 ✔ TE – 0.4 ClS – 0.5 SQ – 0.5 EJ – 0.5 TCl – 0.5 SjJ – 0.5 SjCl – 0.7 J 0.5 SJ 0.2 0.7 T 0.5 0.4 0.5 0.2 Cl K E 0.2 0.1 Q 0.5 0.3 Pb 0.5 S

More Related