Algorithm A : Dijkstra

Graph Representation B : Adjacency List

1. Implement (in C) the Algorithm A using the Graph Representation B as assigned to you in the table below. Give your source codes within your report (not a separate C file). 2. Show that your program works with a user input (can be from a file). Give your screen shots. 3. Design an experiment to evaluate how time efficiency of your algorithm change for "sparse" and "dense" graphs. Do your time measurements, give necessary table(s) or plot(s), and comment on your results. Dijkstra Adjacency List