Lab 5

There are two tasks in lab 5. If you find any mistake or confusion, please directly email jiayaowu1999@sjtu.edu.cn.

You will be graded by how many test cases you can pass, your implementation of required graph class, and a simple report. All the test cases are equally weighted.

Details

JOJ

On JOJ, you need to upload your code of shortest path algorithms.

Report

For the report, you should include a simple comparation of the efficiency of Bellman-Ford and Dijkstra.

Canvas submission

Please zip your code (shortest path algorithm, 2 classes for sparse and dense graph respectively, Fib heap) and your short report and submit them to canvas on time.