Multiple Choice
Two vertices in a graph are ___________ if there is an edge connecting them.
A) Connected
B) Adjacent
C) Ordered
D) None of the above
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q24: A _ is a sequence of edges
Q25: A graph is _ if and only
Q26: What is the maximum number of edges
Q27: What is a directed graph?
Q28: A path in a directed graph is
Q30: An undirected graph is a graph where
Q31: A path in a directed graph is
Q32: The only difference between a depth-first traversal
Q33: The only difference between a depth-first traversal
Q34: A minimum spanning tree is a spanning