mgf1107lecture16

# mgf1107lecture16 - MGF 1107 EXPLORATIONS IN MATHEMATICS...

This preview shows pages 1–2. Sign up to view the full content.

MGF 1107 – EXPLORATIONS IN MATHEMATICS LECTURE 16 Hamilton Paths and Hamilton Circuits Before formally defining Hamilton paths and Hamilton circuits, consider the example below. Ex. The following table lists the least expensive one-way fares offered between four cities. Orlando Atlanta Memphis New Orleans Orlando (O) * Atlanta (A) * Memphis (M) * New Orleans (N) * We can create a graph to illustrate this information, letting the vertices represent the cities and listing the airfares on the corresponding edges. It should be noted that the cost of the one-way flight does not depend on the city of origin. So a flight from Orlando to Atlanta costs the same as one from Atlanta to Orlando. This allows us to list the prices on the edges. We call such graphs weighted graphs . The typical problem we look at concerns finding the minimum cost of flying to each of the cities involved before flying back to the original departure point. We call them traveling salesman problems .

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 09/22/2011 for the course MAC 2311 taught by Professor Evinson during the Spring '08 term at University of Central Florida.

### Page1 / 4

mgf1107lecture16 - MGF 1107 EXPLORATIONS IN MATHEMATICS...

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

View Full Document
Ask a homework question - tutors are online