GATE Computer Science (CS) 2014 Shift 2 Solved Paper

Question : 24 of 65

Marks: +1, -0

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing