Answer Happy

Posted: **Thu Jul 14, 2022 2:18 pm**

: A Directed Graph Is Represented As An Edge List What Is The Worst Case Time Complexity To Find If Two Vertices Are Adja 1 (16.93 KiB) Viewed 23 times

A directed graph is represented as an Edge List. What is the worst case time complexity to find if two vertices are adjacent to each other in this graph (neighbors of each other / connectedness property)? O(1) Olog V) O(V) O(log E) O(E) OIEV)