Compare the performance of shortest path algorithms below.

• SPFA
• Dijstra with priority queue
• Dijstra Dial implementation
• PAPE (Bellman Ford with dequeue)
• Graphical Floyd Warshall
• Algebracial Floyd Warshall

make

./bin/SPSPComparison.out "sp file" "output file name" [iteration number]

• sp file: Path of input sp file
• output file name: Output csv name
• iteration number: Iteration to run these algorithm. The result will be averaged.

make gen

Generate 32 sample test case in input/test_case/

make run_all_test_case

Test all the case in input/test_case/

Lee-W

MIT