Let G V E be a simple undirected graph and s be a particular vertex in it called the source gate cse 2015

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

gate-cse-2015-->View question

## Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. -gate-cse-2015

For x ∈ V, let d(x) denote the shortest distance in G from s to x. A breadth first search (BFS) is performed starting at s. Let T be the resultant BFS tree. If (u, v) is an edge of G that is not in T, then which one of the following CANNOT be the value of d(u) – d(v)?
A=-1
B=0
C=1
D=2

By:milan-ransingh

Taged users:

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

Answer: (D) Note that the given graph is undirected, so an edge (u, v) also means (v, u) is also an edge. Since a shorter path can always be obtained by using edge (u, v) or (v, u), the difference between d(u) and d(v) can not be more than 1.
prajwalamv

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer