A(n) adjacency __________ uses a two-dimensional array to represent a graph.
A) list
B) matrix
C) stack
D) queue
Correct Answer:
Verified
Q4: A graph that is unconnected has no
Q5: Any graph that is connected and contains
Q6: The term _ refers to visiting all
Q7: We can represent all the vertices of
Q8: Complete the definition of an operator== member
Q10: A dense graph is one in which
Q11: If a graph is dense, the adjacency
Q12: An adjacency list uses less (more) storage
Q13: The breadth-first search algorithm stores identified vertices
Q14: Suppose G is an undirected graph consisting
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents