Route Inspection The first method mark is for three distinct pairings of the correct four odd nodes. Get this wrong and you lose all say (five) marks.

Slides:



Advertisements
Similar presentations
The Chinese Postman Problem Route Planning Map Colouring
Advertisements

Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Analysis of Algorithms Depth First Search. Graph A representation of set of objects Pairs of objects are connected Interconnected objects are called “vertices.
1 Lecture 5 (part 2) Graphs II Euler and Hamiltonian Path / Circuit Reading: Epp Chp 11.2, 11.3.
CS 206 Introduction to Computer Science II 11 / 07 / 2008 Instructor: Michael Eckmann.
How to solve Euler paths & circuits. by Mr. King.
What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
Applications of Depth-First Search
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
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.
Ms. Neal Geometry. In order to write an equation of a line, you will need two points: 1) Label each point (x 1,y 1 ), (x 2,y 2 ) 2) Substitute the information.
Graphs and Euler cycles Let Maths take you Further…
C o n f i d e n t i a l HOME NEXT Subject Name: Data Structure Using C Unit Title: Graphs.
Least Common Multiple Lesson 3-6. Multiples A multiple is formed by multiplying a given number by the counting numbers. The counting numbers are 1, 2,
Management Science 461 Lecture 9 – Arc Routing November 18, 2008.
Shortest Path Algorithm This is called “Dijkstra’s Algorithm” …pronounced “Dirk-stra”
Lecture 12-2: Introduction to Computer Algorithms beyond Search & Sort.
Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,
Chapter 2 Graph Algorithms.
Graph Theory Topics to be covered:
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
Shortest Path. What is Shortest Path In a network, there are often many possible paths from one node in a network to another. It is often desirable (for.
Networks.
COSC 2007 Data Structures II Chapter 14 Graphs III.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
Chinese postman problem
xy ? {(3,-2), (5,4), (-2,0)}. A relation is set of ordered pairs, where one number is mapped to another number.
COSC 2007 Data Structures II Chapter 14 Graphs I.
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.
D1 stuff The tail wags the dog. M1A1 A1 A1 We mark your best effort.
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Directed Graphs AZ Standard Use directed graphs to solve problems.
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.
Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :
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.Which of the following is NOT an algorithm? a.A set of instructions used to build a wardrobe b.A flow chart used to solve a quadratic equation c.A note.
Unit 3 Chinese Postman. Non - Eulerian Semi - Eulerian Eulerian.
Chapter Chapter Summary Graphs and Graph Models Graph Terminology and Special Types of Graphs Representing Graphs and Graph Isomorphism Connectivity.
Data Structures & Algorithm Analysis lec(8):Graph T. Souad alonazi
Graphs Chapter 20.
AS Maths Decision Paper June 2011 Model Answers.
Discrete Structures – CNS2300
Section 2: Multiple choice
Chapter 2: Business Efficiency Lesson Plan
Ellen Walker CPSC 201 Data Structures Hiram College
Depth-First Search.
Discrete Maths 9. Graphs Objective
More Graph Algorithms.
The tail wags the dog. M1A1 A1 A1 We mark your best effort
Chapter 2: Business Efficiency Lesson Plan
Network Notes Ms Allan 2012 AS91260 (2.5) Designed to teach from,
Critical Path Analysis 2
THE CHINESE POSTMAN PROBLEM Liz Biz and Hells Bells.
Fraction Investigation
Level 0.
Section 2: Multiple choice
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.
Decision Maths Graphs.
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
Critical Path Analysis
Kruskal’s Algorithm AQR.
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
Lecture 4: Matching Algorithms
Hamilton Paths and Circuits
Lecture 10 Graph Algorithms
GRAPHS.
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
12.1 Permutations When a question says ‘how many arrangment’..... Think BOXES For each space we have a box In the box write down how many options can go.
Jan 2009.
Presentation transcript:

Route Inspection The first method mark is for three distinct pairings of the correct four odd nodes. Get this wrong and you lose all say (five) marks. State clearly which individual arcs you repeat. ‘Repeat DA, AE, FJ, FK, is accepted whereas ‘repeat DE, FK’ is not. We also don’t accept ‘DAE’. Don’t just point to the table with an arrow. If they ask for you to state the route, count the number of edges (say 14), add on the repeated edges (say 3) then add 1 more to give 18. We count 18 letters in your route, then we check you have the repeats (underlining AB and BA helps), then we check all letters are included.

Route Inspection 2 If a question is ‘the boy starts at K and finishes at a different vertex, traversing each path at least once. Determine where he finishes giving a reason for your answer’ then you will need four things i) ‘Repeat DF (24) ii) as it is the shortest iii) that does not include K. iv) Start at K, finish at E ‘