/ Instructions
All answers to homework problems must be typed and submitted in a PDF file (if you need help converting to PDF - please ask. I’m happy to help!).
Make sure to include a README.txt file for your code that tells me what OS you built / tested your code in and how to compile your code (remember: the easier for me to build it – the happier I am – the better grade you get).
Code should be easy to read… please comment any complex blocks of code and / or tell me what each of the methods do (remember: if I understand your code easily – the happier I am – the better grade you get).
Remember to cite URL sources you use in comments inside your code.
Please compress your PDF file with your code and README.txt file into a zip file or tar.gz.
/ Homework Questions
Chapter 5 Review Questions (Starting on pg. 427): R1, R2, R3, R17, R19, R20
/ Programming Assignment
In whatever language you choose, implement either:
Dijkstra's algorithm (I HIGHLY RECOMMEND IMPLEMENTING THIS ALGORITHM)
Bellman-ford algorithm
Test your algorithm by running it on the graph found in P3 on page 429 of the book.
Useful links:
https://en.wikipedia.org/wiki/Dijkstra's_algorithm
http://cs.smith.edu/~streinu/Teaching/Courses/274/Spring98/Projects/Philip/fp/dijkstra.htm
REMEMBER TO CITE WHATEVER HELP YOU FIND ONLINE
