Ch 5 Notes Part 2

Ch 5 Notes Part 2 - Can you trace the drawings without...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Can you trace the drawings without lifting your pencil and without retracing any of the lines? What is an Euler Circuit Problem? It is a routing problem ways to deliver goods/services such as mail, packages, pizza, garbage collection, bus services Existence Question Is a route possible? Optimization Question Of all possible routes, which one is the best when taking into consideration cost, distance, time In an Euler Circuit problem, the route must pass through everywhere better definition to come later Graphs : a picture consisting of dots called vertices and lines called edges Loop : an edge connecting a vertex back to itself Vertex Set : listing all of the vertices { } V A B C D E F = , , , , , Edge Set : listing all of the edges { } E AB AD BB BC BE CD CD DE = , , , , , , , There is a loop at vertex B F is an isolated vertex Disconnected Graph Graph With No Edges { } V A B C D = , , , {} E = The Empty Set Whos Dating Who? Different . . . But The Same?!?...
View Full Document

Page1 / 20

Ch 5 Notes Part 2 - Can you trace the drawings without...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online