00:01
Performance behavior of a linked adjacency list for determining whether an edge exists between two vertices.
00:05
A, linear with the length of the list.
00:07
B, o, n2, where n is the number of vertices.
00:11
C, logarithmic with the total number of vertices.
00:15
Or d, constant time.
00:17
The correct answer is a.
00:23
In a linked adjacency list representation of a graph, each vertex has a list of adjacent vertices.
00:30
To determine if an edge exists between two specific vertices, you need to search through the list of one of the vertices to see if the other vertex is present.
00:40
The time it takes to find out whether an edge exists is therefore proportional to the number of vertices connected to the vertex being checked.
00:53
This makes the operation o to the k, where k is the number of neighbors or the degree of vertexes...