G is an undirected graph with vertex set {v1, v2, v3, v4, v5, v6, v7} and edge…

ISRO Scientist/Engineer SC · 2020 · Computer Science

G is an undirected graph with vertex set {v1, v2, v3, v4, v5, v6, v7} and edge set {v1v2, v1v3, v1v4, v2v4, v2v5, v3v4, v4v5, v4v6, v5v6, v6v7}. A breadth-first search (BFS) starts at v1. Which edge must be a BFS tree edge, regardless of the order in which each vertex’s neighbors are scanned?

A.
v2v4
B.
v1v4
C.
v4v5
D.
v3v4

Attempted by 499 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2