This preview shows page 1. Sign up to view the full content.
Unformatted text preview: from Problem A. Highlight the edges in the full shortest path tree, after the conclusion of Dijkstras algorithm. Problem C: Use the quick (approximate) travelling salesperson construction to nd a tour for the cost matrix below. The rst node used should be node 1. In what order are nodes inserted by the algorithm? What is the total cost of the tour produced? Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 1 4 3 2 5 4 Node 2 4 2 4 5 4 Node 3 3 2 1 5 6 Node 4 2 4 1 2 5 Node 5 5 5 5 2 2 Node 6 4 4 6 5 2 Problem D: Suppose you are given a connected graph in which each edge has a colour, either red or blue. (The colouring is given, it cannot be changed.) How would you nd a spanning tree of the graph containing as many red edges as possible? For this problem I want you to either describe a new algortihm or modify one of the algorithms from class....
View
Full
Document
This note was uploaded on 05/28/2011 for the course AMS 301 taught by Professor Estie during the Spring '11 term at University of Florida.
 Spring '11
 Estie

Click to edit the document details