hw5 - CSCI 323/700 SPRING 2010 HOMEWORK 5 Written Problems....

Info iconThis preview shows pages 1–2. 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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSCI 323/700 SPRING 2010 HOMEWORK 5 Written Problems. due Mar 10 (Wed), 6.30 pm. 1. Prim’s Algorithm Run Prim’s algorithm on the following graph, starting from the node s . Write down the intermediate values of the set S in the execution of Prim’s algorithm, along with the final MST. In case of a tie, pick the node that comes first in alphabetical order. a b c s e f g 2 8 5 4 6 4 8 6 8 9 11 Programming Problem: Implementing Dijkstra due Mar 11 (Thu), 11.59 pm. In this problem, we investigate how Dijkstra’s Algorithm may be used to solve the “shortest paths problem” in the real world. You are provided with data from the National Highway Planning Network (NHPN) in ps5_dijkstra.zip . You can learn more about the NHPN at http://www.fhwa.dot.gov/planning/nhpn/ This data includes node and link text files from the NHPN. Open nhpn.nod and nhpn.lnk in a text editor to get a sense of how the data is stored ( datadict.txt has a more precise description of the data fields and their meanings). You are also provided with a Python module nhpn.py containing code to load the text files into Node and Link objects. Read nhpn.py to understand the format of the Node and Link...
View Full Document

Page1 / 2

hw5 - CSCI 323/700 SPRING 2010 HOMEWORK 5 Written Problems....

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

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