Question 4 In breadth-first search (BFS) of graph G (unweighted), if there exists an edge (x, y) in G, then which of the following statements is correct? (1) node y is in the node x's adjacency list. (2) (x,y) can be a BFS tree edge. (3) (x,y) cannot be a forward edge. (4) y.d must be at most x.d+1 (5) node x must be in the queue at the same time or before node y is in the queue. (6) If (x.y) is in shortest path from the source node to node y, (x.y) must be in some BFS tree. (1) (2) O (4) (5) 2 (6)
Question 4 In breadth-first search (BFS) of graph G (unweighted), if there exists an edge (x, y) in G, then which of the following statements is correct? (1) node y is in the node x's adjacency list. (2) (x,y) can be a BFS tree edge. (3) (x,y) cannot be a forward edge. (4) y.d must be at most x.d+1 (5) node x must be in the queue at the same time or before node y is in the queue. (6) If (x.y) is in shortest path from the source node to node y, (x.y) must be in some BFS tree. (1) (2) O (4) (5) 2 (6)
Related questions
Question
Transcribed Image Text:Partial
Question 4
In breadth-first search (BFS) of graph G (unweighted), if there exists an edge (x, y) in G,
then which of the following statements is correct?
(1) node y is in the node x's adjacency list.
(2) (x.y) can be a BFS tree edge.
(3) (x.y) cannot be a forward edge.
(4) y.d must be at most x.d+1
(5) node x must be in the queue at the same time or before node y is in the queue.
(6) If (x.y) is in shortest path from the source node to node y, (x.y) must be in some BFS
tree.
(1)
(2)
O (3)
O (4)
O (5)
(6)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
