Networks & Minimum Spanning Trees. Cambridge is installing fibre optic cabling between the surrounding villages. All the villages must be connected. We.

Slides:



Advertisements
Similar presentations
Decision Maths Networks Kruskals Algorithm Wiltshire Networks A Network is a weighted graph, which just means there is a number associated with each.
Advertisements

ITS THE FINAL LECTURE! (SING IT, YOU KNOW YOU WANT TO) Operations Research.
Networks Prim’s Algorithm
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.
Discrete Maths Chapter 3: Minimum Connector Problems Lesson 1: Prim’s and Kruskal.
IKI 10100: Data Structures & Algorithms Ruli Manurung (acknowledgments to Denny & Ade Azurat) 1 Fasilkom UI Ruli Manurung (Fasilkom UI)IKI10100: Lecture10.
MINIMAL CONNECTOR PROBLEMS Problem: A cable TV company is installing a system of cables to connect all the towns in a region. The numbers in the network.
Prim’s Algorithm from a matrix A cable TV company is installing a system of cables to connect all the towns in the region. The numbers in the network are.
Aims: To know the terms: tree, spanning tree, minimum spanning tree. To understand that a minimum spanning tree connects a network using the lowest possible.
7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.
Algorithms on graphs In Decision Mathematics, a graph consists of points (called vertices or nodes) which are connected by lines (edges or arcs). Eg in.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Lecture 12-2: Introduction to Computer Algorithms beyond Search & Sort.
Minimum spanning trees Aims: To know the terms: tree, spanning tree, minimum spanning tree. To understand that a minimum spanning tree connects a network.
Graph Dr. Bernard Chen Ph.D. University of Central Arkansas.
Networks.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
Aim: Graph Theory - Trees Course: Math Literacy Do Now: Aim: What’s a tree?
Dear teacher, We wanted to apologize for the technical issues that EDpuzzle has experienced today. We have teachers in our team and understand how frustrating.
Minimum spanning trees Aims: To know the terms: tree, spanning tree, minimum spanning tree. To understand that a minimum spanning tree connects a network.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.4 Trees.
Minimum Spanning Trees Suppose G = (V, E) is a undirected network. Each edge (i,j) in E has an associated ‘length’ c ij (cost, time, distance, …) Determine.
Minimum Spanning Trees Easy. Terms Node Node Edge Edge Cut Cut Cut respects a set of edges Cut respects a set of edges Light Edge Light Edge Minimum Spanning.
Fundamental Data Structures and Algorithms (Spring ’05) Recitation Notes: Graphs Slides prepared by Uri Dekel, Based on recitation.
Minimal Spanning Tree Problems in What is a minimal spanning tree An MST is a tree (set of edges) that connects all nodes in a graph, using.
Lecture19: Graph III Bohyung Han CSE, POSTECH CSED233: Data Structures (2014F)
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
EXCURSIONS IN MODERN MATHEMATICS SIXTH EDITION Peter Tannenbaum 1.
Graphs and MSTs Sections 1.4 and 9.1. Partial-Order Relations Everybody is not related to everybody. Examples? Direct road connections between locations.
Minimum Spanning tree Prim’s algorithm 1.Select any vertex 2.Select the shortest edge connected to that vertex 3.Select the shortest edge which connects.
Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :
Lecture 19 Minimal Spanning Trees CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
1 1 Slide © 2005 Thomson/South-Western Chapter 9 Network Models n Shortest-Route Problem n Minimal Spanning Tree Problem n Maximal Flow Problem.
Operations Research II Course,, September Part 2: Network Flow Operations Research II Dr. Aref Rashad.
Minimum Spanning Trees
Minimum Spanning Tree Chapter 13.6.
Kruskal’s Algorithm Elaicca Ronna Ordoña. A cable company want to connect five villages to their network which currently extends to the market town of.
Topological Sort (topological order)
Minimum Spanning Tree.
Minimum Spanning Trees
CSE373: Data Structures & Algorithms Lecture 12: Minimum Spanning Trees Catie Baker Spring 2015.
Minimum Spanning Trees
Section 14.4 Trees.
Shortest Path.
4-4 Graph Theory Trees.
Warm Up – Friday.
Louisiana Travels.
Example A cable company want to connect five villages to their network which currently extends to the market town of Avonford. What is the minimum.
Minimum spanning trees
Minimum spanning trees
Minimum spanning trees
Networks Kruskal’s Algorithm
Minimum Spanning tree Select any vertex
CSE 373: Data Structures and Algorithms
CSC 380: Design and Analysis of Algorithms
Networks Prim’s Algorithm
Minimum spanning trees
Minimum Spanning Trees (MSTs)
Kruskal’s Algorithm AQR.
Section 13.4 Trees.
CSE 373: Data Structures and Algorithms
Spanning Tree.
Presentation transcript:

Networks & 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. Networks and Minimum Spanning Trees

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

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

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

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.

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 ✖ ✔

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.

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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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

C M B F S G O T I 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)

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

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.

Cl S Q Pb K T SJ J E

Cl S Q Pb K T SJ J E

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

Cl S Q Pb K T SJ J E 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

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

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

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

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

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

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

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

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

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

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

Cl S Q Pb K T SJ J E The students should tunnel between the university buildings as shown. The total length of tunneling needed is 2.5 miles.