Q119
Complete the given snippet of code for the adjacency list representation of a weighted directed graph. class neighbor int vertex, weight; ____ next; class vertex string name; _____ adjlist; vertex adjlists[101];
A.
vertex, vertex
B.
neighbor, vertex
C.
neighbor, neighbor
AnswerD.
vertex, neighbor
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board