In Algorithims Algorithm > BFS

Graph Representation > Adjacency List

1-Implement (in C) the Algorithm BFS using the Graph Representation Adjacency List as assigned to you in the table below. Give your source code

2. Show that your program works with a user input (can be from a file). Give the 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.