Which of the following is true about an undirected graph?
A) a graph-processing algorithm can move in only one direction along an edge that connects two vertices
B) their edges do not indicate direction
C) there can be multiple edges connecting any two vertices
D) there is a source vertex and a destination vertex

Question

Quizplus · Accepted Answer

In an undirected graph, the edges do not indicate direction, meaning that there is no source or destination vertex. Additionally, there can be multiple edges connecting any two vertices, and a graph-processing algorithm can move in any direction along an edge that connects two vertices.

Which of the Following Is True About an Undirected Graph