{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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
Can you trace the drawings without lifting your pencil and without retracing any of the lines?
Background image of page 1

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

View Full Document Right Arrow Icon
Background image of page 2
What is an Euler Circuit Problem? It is a routing problem – ways to deliver goods/services such as mail, packages, pizza, garbagecollection, bus services Existence Question – Is a route possible? Optimization Question – Of all possible routes, which oneis thebest when taking into consideration cost, distance, time In an Euler Circuit problem, the routemust pass through everywhere better definition to comelater
Background image of page 3

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

View Full Document Right Arrow Icon
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 A B A D B B B C B E C D C D D E = , , , , , , , There is a loop at vertex B F is an isolated vertex
Background image of page 4
Disconnected Graph Graph With No Edges { } V A B C D = , , , { } E = The Empty Set Who’s Dating Who?
Background image of page 5

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

View Full Document Right Arrow Icon
Different . . . But The Same?!?
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}