GATE Programming and Data Structures: Graphs – Previous Year Questions

1 GATE previous year questions on Graphs (Programming and Data Structures, Computer Science) with answers and explanations, from every paper.

1. GATE 2016 CS (CS2) Q51 (2 marks, Multiple choice) – Each edge of a simple undirected graph has two adjacency-list entries, one at each endpoint. A twin pointer connects these entries. With n vertices, m…