Graphs (Data Structures), ASAP please. Consider an undirected graph defined as f
ID: 3695839 • Letter: G
Question
Graphs (Data Structures), ASAP please.
Consider an undirected graph defined as follows: Set of vertices = {0,1, 2, 3, 4} and Set of edges = {(0, 1), (0, 2), (0,3), (0, 4), (1,3), (3, 4)} Which of the following orders can the vertices be visited using the depth first search starting with vertex 1? a-1,4, 2, 3,0 b. 1, 2, 3, 4, 0 c. 1,3,4,0,2 d. 1,3, 2,0, 4 The depth first search is a traversal that visits a source vertex s, then visits the vertices one edge away from s, then two edges away, and so on. True False The depth-first search implementation uses a queue to keep up with neighbors. True False A simple graph is a graph where an edge is connected to two different vertices. The adjacency matrix for a simple graph will always have zeros along the diagonal. True False Consider the following directed graph description: Set of vertices = {0,1, 2, 3, 4} and the Set of edges = {(0, 2), (0, 3), (1, 0), (2, 4), (3, 1), (3, 4)}. This graph is strongly connected. True FalseExplanation / Answer
Answer:
Q-1 only C option satisfies rest dont have paths.
Q-3 FALSE depth first search uses a stack not queue
Q-2 TRUE it explores the depth
Q-4 . TRUE
As in a simple graph an edge is always between two different vertices and there are no loops
Q-5. FALSE
In this graph there is a path from (2,4) but there is no path from (4,2)
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.