GATEverse Practice, past papers & mock tests
GATE 2025 · session-5
Programming, Data Structures and AlgorithmsGraph TraversalsmediumMSQ2 marks
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below. It is given that \( a - b - c - d \) is a shortest path between \( a \) and \( d \); \( e - f - g - h \) is a shortest path between \( e \) and \( h \); \( a - f - c - h \) is a shortest path between \( a \) and \( h \). Which of the following is/are NOT the edges of \( G \)?

Select every correct option.

Save your progress

Related Programming, Data Structures and Algorithms PYQs