edited by
717 views
0 votes
0 votes

In an adjacency list representation of an undirected graph G = (V,E), for any 2 sets of vertices V1 and V2 let, distance (V1,V2) be defined as the minimum of the length of shortest distance between a vertex in V1 and V2, if V1 ∩ V2 ≠ ∅, then distance  (V1,V2) = 0. the most optimal time complexity for computing distance (V1,V2) is :

 

WHAT KIND OF SETS IT IS TALKING ABOUT .....?AND HOW IT CAN BE FORMED  PLEASE GIVE EXAMPLE .

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
3
0 votes
0 votes
2 answers
4