Jan 2007.

Slides:



Advertisements
Similar presentations
A B Q Chord AB is 18. The radius of Circle Q is 15. How far is chord AB from the center of the circle? 9 15 (family!) 12 x.
Advertisements

Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.
6.8 The Cheapest-Link Algorithm. The Cheapest-Link Algorithm Pick the edge with the smallest weight and mark it Pick the next edge with the smallest weight.
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.
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.
Chapter 5. Vocab Review  Intersect  Midpoint  Angle Bisector  Perpendicular Bisector  Construction of a Perpendicular through a point on a line Construction.
ChainTree: A tale of two hierarchies  Transform hierarchy: approximates kinematics of protein backbone at successive resolutions  Bounding volume hierarchy:
READING QUIZ In the analysis of a planar truss, all the member are assumed to be ___________. A) three-force member B) zero-force member C) two-force member.
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.
 The factorial function (n!)  Permutations  Combinations.
Parallel Lines and Proportional Parts By: Jacob Begay.
Minimum spanning trees Aims: To know the terms: tree, spanning tree, minimum spanning tree. To understand that a minimum spanning tree connects a network.
10.2 Arcs and chords Pg 603. Central angle Central angle- angle whose vertex is the center of a circle A B C  ACB is a central angle.
Lesson 6.2 Find Arc Measures
Chapter 4 sections 1 and 2.  Fig. 1  Not connected  All vertices are even.  Fig. 2  Connected  All vertices are even.
MATH 3581 — College Geometry — Spring 2010 — Solutions to Homework Assignment # 3 B E A C F D.
Geometry 9.1 An Introduction to Circles. Circle The set of all points in a plane at a given distance from a given point.. P P is the center of the circle.
Chapter 6: Structural Analysis
Computing the chromatic number for block intersection graphs of Latin squares Ed Sykes CS 721 project McMaster University, December 2004 Slide 1.
Holt CA Course Introduction to Geometry Warm Up Warm Up Lesson Presentation California Standards Preview.
Fundamental Data Structures and Algorithms (Spring ’05) Recitation Notes: Graphs Slides prepared by Uri Dekel, Based on recitation.
Chapter 11 – Counting Methods Intro to Counting Methods Section 11.1: Counting by Systematic Listing.
Vocabulary and Representations of Graphs. NC Standard Course of Study Competency Goal 1: The learner will use matrices and graphs to model relationships.
Geometric Constructions with Understanding **This is meant as a resource to the teacher! It is NOT intended to replace teaching in the classroom OR the.
AES Encryption FIPS 197, November 26, Bit Block Encryption Key Lengths 128, 192, 256 Number of Rounds Key Length Rounds Block.
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.
Geometry: Plane Figures Chapter. point A point marks a location. A A B B line segment the part of the line between 2 points endpoints.
By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from.
Minimum Spanning Trees Text Read Weiss, §9.5 Prim’s Algorithm Weiss §9.5.1 Similar to Dijkstra’s Algorithm Kruskal’s Algorithm Weiss §9.5.2 Focuses on.
8-1 Building Blocks of Geometry Course 2 Warm Up Warm Up Lesson Presentation Lesson Presentation Problem of the Day Problem of the Day.
MATRIX FORM OF PRIM’S ALGORITHM. This network may be described using a Distance Matrix.
AS Maths Decision Paper January 2011 Model Answers.
Unit 3 Chinese Postman. Non - Eulerian Semi - Eulerian Eulerian.
1 Data Structures and Algorithms Graphs. 2 Graphs Basic Definitions Paths and Cycles Connectivity Other Properties Representation Examples of Graph Algorithms:
The graph is neither Eulerian or Semi – Eulerian as it has 4 ODD vertices.
Warm Up Problem of the Day Lesson Presentation Lesson Quizzes.
Geometry Homework 5.3 Pages 282.
AS Maths Decision Paper June 2011 Model Answers.
AS Maths Decision Paper June 2011 Model Answers.
Objective: To use the properties of midsegments to solve problems.
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.
Minimum Spanning Trees and Shortest Paths
Combinations COURSE 3 LESSON 11-3
Mid-point Theorem and Intercept Theorem
It’s a powerpoint! SWEET!
Coplanar lines that don't intersect.
∆ABC ≅ ∆DEC supplementary ABC DEC ∠DEC non-included AAS ≅ Thm
CSE373: Data Structures & Algorithms Lecture 12: Minimum Spanning Trees Catie Baker Spring 2015.
Directed Graphs (Part II)
CSE373: Data Structures & Algorithms Lecture 20: Minimum Spanning Trees Linda Shapiro Spring 2016.
Minimum Spanning Trees
Single Source Shortest Paths Bellman-Ford Algorithm
AS Maths Decision Paper January 2006 Model Answers.
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.
Objectives Find the lengths of segments formed by lines that intersect circles. Use the lengths of segments in circles to solve problems.
Minimum spanning trees
AS Maths Decision Paper January 2012 Model Answers.
AB AC AD AE AF 5 ways If you used AB, then, there would be 4 remaining ODD vertices (C, D, E and F) CD CE CF 3 ways If you used CD, then, there.
Minimum spanning trees
Minimum spanning trees
AS Maths Decision Paper January 2010 Model Answers.
Parallel Lines and Proportional Parts
ISOMETRIC PROJECTION BISECT LINE TO GET RED DOT. Down 80 In 70
Latin Square Designs.
Minimum Spanning tree Select any vertex
Kruskal’s Algorithm AQR.
If AD = 10, DC =6, and ED = 15, find DB.
DECISION 1 “It’s obvious” “It’s easy”
Homework Solutions.
Jan 2009.
Presentation transcript:

Jan 2007

AB = 5.5 BC = 8 AI = 9 BD = 13 DE = 9 DG = 11 DF = 12* HI = 16.5 Total = 84 There should be n – 1 edges 9 – 1 = 8 edges *EF or GF could also be used

Note there are two other spanning trees you could have drawn had you used either EF or GF instead of DF. You MUST label each vertex with its corresponding letter There are two other spanning trees you could have drawn had you used either EF or GF instead of DF

GH = 5 GE = 7 HJ = 8 EB = 10 BD = 11 HI = 14 DC = 15 AC = 6 FJ = 19 Jan 2009 GH = 5 GE = 7 HJ = 8 EB = 10 BD = 11 HI = 14 DC = 15 AC = 6 FJ = 19 HK = 22 Total = 117 Total length = 117 miles Next Slide

Label and highlight each vertex Minimum Spanning Tree K I G H J F C A D B E Label and highlight each vertex

AC = 13 AE = 14 EI = 15 CD = 16 CH = 20 EF = 21 FB = 19 BG = 19 Jan 2010 AC = 13 AE = 14 EI = 15 CD = 16 CH = 20 EF = 21 FB = 19 BG = 19 Total Spanning tree = 137

G B C A F H E D I

ODD vertices at B, C, D, E BC + DE BC (22) + DE (18) = 40 BD + CE BD (38) + CE (27) = 65 BE + CD BE (22) + CD (16) = 38 Repeat BE + CD = 38 Total route is 307m + (BE + CD) 38 = 345 metres

Jan 2011

EB = 5 EH = 7 AB = 8 HI = 9 AD = 10 DG = 4 EF = 12 FC = 6 Length of spanning tree = 5 + 7 + 8 + 9 + 10 + 4 + 12 + 6 = 61

Original Spanning tree = 61 aiii) b) A 8 B A H F B E C I D G C 5 E D F 11 G H I Original Spanning tree = 61 AB and BE dropped = -13 GE added= 11 New Spanning tree = (61 – 13 + 11) = 59

June 2012

AD 4 AB 6 AC 16 DE 19 EG 10 GI 12 IH 13 IF 17 Total 97 Total 97

IF

AC

Jan 2013 𝐴𝐵=6.1 𝐶𝐵=7.4 𝐵𝐸=9.7 D𝐸=7.2 𝐹𝐸=10.6 𝐸𝐻=12.5 𝐻𝐼=6.7 𝐺𝐻=8.9 𝑇𝑜𝑡𝑎𝑙=69.1 𝑆𝑒𝑒 𝐴𝑏𝑜𝑣𝑒

GH

EF

AB (The Lowest Value) EH (The Highest Value, from the Spanning Tree)

June 2011

AC = 10 CH = 9 FH = 8 CE = 10 ED = 11 Could use CD GH = 13 DB = 14 1 8 2 6 5 4 7 3 CH = 9 FH = 8 CE = 10 ED = 11 Could use CD GH = 13 DB = 14

75p AC = 10 CH = 9 FH = 8 CE = 10 ED = 11 GH = 13 DB = 14 Total Spanning Tree = 13 14 G B 75p

70p Delete ALL edges connected to H Total Spanning Tree = 10 C 10 E 11 9 11 8 F H D 14 13 14 Total Spanning Tree = 70p G B From the matrix TWO more edges need to be added, (AF 11 and any one of GC, GA, GD and GF all 14 are the lowest)

June 2014

4 1 2 3 7 5 6 70 + 80 + 80 + 85 + 60 + 110 = 485

70 80 80 85 110 60 FI and IS FI and GH

June 2008 𝑛−1= 𝟏𝟎 𝒏−𝟏

AB = 18 BC = 13 BD = 15 CF = 16 DG = 17 GK = 12 KJ = 16 KH = 17 KI = 17 IE = 14 Total Length = 155 Total Length = 155

G D B H A E K C I F J

June2006 AB = 5 BD = 3 DC = 1 DE = 4 DF = 5 FG = 6 GI = 10 GH = 11 HJ = 13 Total = 58 Total = 58