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];
class neighbor
{
int vertex, weight;
____ next;
}
class vertex
{
string name;
_____ adjlist;
}
vertex adjlists[101];A. vertex, vertex
B. neighbor, vertex
C. neighbor, neighbor
D. vertex, neighbor
Answer: Option C
This Question Belongs to Data Structure >> Graphs
Join The Discussion