Question discussion

For the same graph represented using an adjacency LIST instead, what is the worst-case time complexity to check whether an edge exists betw…

572Medium DSSSB TGT Computer Science 0 replies 1 views

For the same graph represented using an adjacency LIST instead, what is the worst-case time complexity to check whether an edge exists between two given vertices?

AO(1)
BO(V)
CO(E)
DO(log V)

Correct answer: B

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!