Chapter 9.CR, Problem 28CR

Exercises $25-31$ use the flight costs shown in Figure 9.119.

You live in New York, and you need to visit Los Angeles, Miami, Seattle, and Houston.

a. How many different circuits does your graph have?

b. Approximate the cheapest route, using the nearest neighbor algorithm. Draw this route's graph.

c. Approximate the cheapest route, using the repetitive nearest neighbor algorithm. Draw this route's graph.

d. Approximate the cheapest route, using the cheapest edge algorithm. Draw this route's graph.

e. Why would it not be appropriate to find the cheapest route, using the brute force method?

			From:
		CHI	NYC	LAX	MIA	SEA	HOU
	CHI		$\$194$	$\$299$	$\$74$	$\$129$	$\$133$
To:	NYC	$\$243$		$\$119$	$\$79$	$\$109$	$\$148$
	LAX	$\$299$	$\$119$		$\$124$	$\$89$	$\$154$
	MIA	$\$74$	$\$79$	$\$124$		$\$169$	$\$94$
	SEA	$\$129$	$\$109$	$\$89$	$\$169$		$\$294$
	HOU	$\$133$	$\$148$	$\$154$	$\$94$	$294

Figure 9.119 Flight costs between Chicago, New York, Los Angeles, Miami, Seattle, and Houston. Source: www.travelocity.com.