Computer Science 2XC3: Final Project
This project will include a final report and your code. Your final report will have the following. You will
be submitting .py (NOT *.ipynb) files for this final project.
• Title page
• Table of Content
• Table of Figures
• An executive summary highlighting some of the main takeaways of your experiments/analysis
• An appendix explaining to the TA how to navigate your code.
For each experiment, include a clear section in your lab report which pertains to that experiment. The report should look professional and readable.
PLEASE NOTE: This is the complete Part I and II. Complete Parts 1 – 5 in group. Part 6 needs to be completed individual. Please refer to the plagiarism policy in Syllabus.
Part 1 : Single source shortest path algorithms
Part 1.1: In this part you will implement variation of Dijkstra’s algorithm. It is a popular shortest path algorithm where the current known shortest path to each node is updated once new path is identified. This updating is called relaxing and in a graph with

标签：