Chapters 1-8, which is available online and include interactive programing and lectures
http://interactivepython.org/runestone/static/pyth…
1. Choose two different algorithms to find the shortest path. Using those
algorithms, implement “program_a.py” which uses the first to find the
shortest path between nodes A and I for the graph below. Implement
“program_b.py” which uses the second to find the shortest path between
nodes A and I for the graph below. Use timeit to measure the performance on
both.
Write a discussion that compares results in program_a.py and program_b.py. In
your discussion, include analysis of the time complexity, i.e Big O. ( graph is given below)
2. Create a Microsoft word document that provides screen captures of running your
algorithms with your commentary of the results and your code. At the END of the
document, include your python source code at the END of the report for reference
and turnitin checking, in TEXT format, NOT screen capture
0 comments