Question

is it true that by using an adjacency list, you might need to search the entire list to determine if an edge exists between any two given vertices.

Answer 1

Regardless of how you implement a graph, you need a container such as a dictionary for the graph's vertices. Using an adjacency list, “you need to search the entire list to determine if an edge exists between any two given vertices” An adjacency matrix uses less space for a sparse graph than an