Question

The correct set of graph representation is

• A. Stack, queue, matrix, graph
• B. Adjacency matrix, sparse list, edge list
• C. Adjacency matrix, adjacency list, edge list
• D. Incidence matrix, skip list, dictionary

Hint:

Most graph questions involve three standard representations: Adjacency Matrix, Adjacency List and Edge List.

Answer 1

The Correct Option is C

Concept: Graphs are important data structures consisting of: \[ G=(V,E) \] where \[ V=\text{Vertices} \] and \[ E=\text{Edges}. \] To store graphs efficiently in memory, different graph representations are used. The most common representations are:
• Adjacency Matrix
• Adjacency List
• Edge List

Step 1: Understand Adjacency Matrix.
An adjacency matrix uses a two-dimensional matrix. If an edge exists between vertices \(i\) and \(j\), \[ A[i][j]=1. \] Otherwise, \[ A[i][j]=0. \]

Step 2: Understand Adjacency List.
Each vertex stores a list of neighboring vertices. This representation is efficient for sparse graphs.

Step 3: Understand Edge List.
An edge list stores all edges as pairs: \[ (u,v). \] It is one of the simplest graph representations.

Step 4: Choose the correct option.
The standard graph representations are \[ \boxed{\text{Adjacency Matrix, Adjacency List, Edge List}} \] Hence option (C) is correct.