Question

Need help, thanks!

In a graph with v vertices and e edges, which of the following maximum sizes is not correct for the shortest path computation? O v for the number of adjacency lists O e for the total size of all adjacency lists O e for the size of the dictionary O v for the size of the queue O all of the above are correct

Answer 1

Let's analyze the options one by one:

1.) v for the number of adjaceny list:

• Adjacency lists will be formed for each vertices only. So maximum number of adjacency list that will exit is equal to number of vertices in the graph

2.) e as total size of all adjaceny list.

• There can be only a maximum of e number of connection for any adjacency list.
• So, e can be used be used as maximum size for all adjacency list.

3.) e as size of dictionary

• In the dictionary representation of graph, the size of the dictionary must be ATLEAST e.
• e cannot be set as maximum size of dictionary, it will lead to memory errors.
• This option is our answer

ANswer: option 3