Question: 1 a) Graphs can be implemented using either adjacency list or adjacency matrix. 5 marks Explain carefully, under what circumstances would you prefer to implement

1 a) Graphs can be implemented using either adjacency list or adjacency matrix. 5 marks Explain carefully, under what circumstances would you prefer to implement a graph using (1) adjacency list, and (2) adjacency matrix. b) Bellman Ford and Dijkstra's algorithms solve the single source shortest path 5 marks (SSSP) problem. Explain the circumstances when you would use each of these algorithms c) Using the Dijkstra's algorithm, determine the shortest path from a to all vertices 10 marks 4 6 3 2 5 a d e 7 4 Show your workings
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
