Question: B) Consider the below graph with '1' as the source vertex, Dijkstra's algorithm for single source shortest path is implemented to find the shortest
B) Consider the below graph with '1' as the source vertex, Dijkstra's algorithm for single source shortest path is implemented to find the shortest path. There is a debate between 3 students: Aruna says the best way to represent this graph is to use an adjacency list. Bablo says that the best way to represent this is the adjacency matrix. While, Cathy says that it hardly matters as it's the same 3/0 al gorithm in case 23/0410 your answer on why they are correct. 022da04757-82232 20/0 11. 2022da04757-8223 14 h 4 10 2da04757-8226 3 1 324304757-82232-2023/04 OP 22da04757-$2252-2023
Step by Step Solution
There are 3 Steps involved in it
Cathy is correct The choice of representation for the graph adjacency list or adjacency matrix does ... View full answer
Get step-by-step solutions from verified subject matter experts
