Adjacency List vs Matrix When to Choose Which in DSA C - Complexity Comparison

Time Complexity: Adjacency List vs Matrix When to Choose Which

O(1) for adjacency matrix, O(k) for adjacency list

Understanding Time Complexity

We want to understand how the time to check connections in a graph changes depending on how we store it.

Which storage method is faster for different tasks and graph sizes?

Scenario Under Consideration

Analyze the time complexity of checking if an edge exists between two nodes.

// Using adjacency matrix
int hasEdgeMatrix(int n, int matrix[n][n], int u, int v) {
    return matrix[u][v];
}

// Using adjacency list
int hasEdgeList(int u, int v, int* adj[], int sizes[]) {
    for (int i = 0; i < sizes[u]; i++) {
        if (adj[u][i] == v) return 1;
    }
    return 0;
}
    

This code checks if there is a direct connection (edge) between two nodes using two different graph storage methods.

Identify Repeating Operations

Look at what repeats when checking edges.

• Primary operation: For matrix, direct access; for list, loop through neighbors.
• How many times: Matrix does 1 check; list loops up to the number of neighbors of node u.

How Execution Grows With Input

Imagine the graph grows bigger with more nodes and edges.

Input Size (n)	Matrix Checks	List Checks (avg neighbors)
10 nodes	1 check	about 2-3 checks
100 nodes	1 check	about 5-10 checks
1000 nodes	1 check	about 10-20 checks

Matrix access stays the same no matter the size. List checks grow with how many neighbors a node has.

Final Time Complexity

Time Complexity: O(1) for adjacency matrix, O(k) for adjacency list

This means matrix lets you check edges instantly, while list depends on how many neighbors the node has.

Common Mistake

[X] Wrong: "Adjacency list is always faster because it uses less space."

[OK] Correct: Checking if an edge exists can be slower with lists if a node has many neighbors, because you must look through them one by one.

Interview Connect

Knowing when to use adjacency lists or matrices shows you understand trade-offs in data structures, a key skill in problem solving.

Self-Check

What if the graph is very dense (almost every node connected to every other)? How would the time complexity of adjacency list checks compare to adjacency matrix?

Practice

1. Which data structure is generally better for representing a graph with very few edges compared to the number of vertices?

easy

A. Adjacency List

B. Adjacency Matrix

C. Edge List

D. Incidence Matrix

Solution

1. Step 1: Understand graph density

   A graph with very few edges compared to vertices is called a sparse graph.

2. Step 2: Choose efficient representation for sparse graphs

   Adjacency lists store only existing edges, saving space for sparse graphs, unlike adjacency matrices which use space for all possible edges.

3. Final Answer:

   Adjacency List -> Option A

4. Quick Check:

   Sparse graph = Adjacency List [OK]

Hint: Sparse graph? Use adjacency list for space efficiency [OK]

Common Mistakes:

• Choosing adjacency matrix for sparse graphs wastes space
• Confusing edge list with adjacency matrix
• Thinking adjacency matrix is always better

2. Which of the following is the correct way to declare an adjacency matrix for a graph with 4 vertices in C?

easy

A. int graph[4][4][4];

B. int graph[4];

C. int graph[][] = new int[4][4];

D. int graph[4][4];

Solution

1. Step 1: Recall C array declaration syntax

   In C, a 2D array for 4 vertices is declared as int graph[4][4];

2. Step 2: Check options for correctness

   int graph[4][4]; matches correct syntax; int graph[4]; is 1D array; int graph[][] = new int[4][4]; uses Java syntax; int graph[4][4][4]; is 3D array.

3. Final Answer:

   int graph[4][4]; -> Option D

4. Quick Check:

   C 2D array syntax = int graph[4][4]; [OK]

Hint: C 2D arrays use int name[rows][cols]; syntax [OK]

Common Mistakes:

• Using Java or other language syntax in C
• Declaring wrong array dimensions
• Confusing 1D and 2D arrays

3. Given the following adjacency matrix for a graph with 3 vertices:

int graph[3][3] = {
  {0, 1, 0},
  {1, 0, 1},
  {0, 1, 0}
};

What is the output of the code snippet that prints all neighbors of vertex 1?

for (int i = 0; i < 3; i++) {
  if (graph[1][i] == 1) {
    printf("%d ", i);
  }
}

medium

A. 0 2

B. 1 2

C. 0 1

D. 1 0 2

Solution

1. Step 1: Analyze adjacency matrix row for vertex 1

   Row 1 is {1, 0, 1}, meaning edges to vertices 0 and 2.

2. Step 2: Trace loop printing neighbors

   Loop checks graph[1][i] == 1; prints i when true. i=0 and i=2 satisfy condition.

3. Final Answer:

   0 2 -> Option A

4. Quick Check:

   Neighbors of vertex 1 = 0 and 2 [OK]

Hint: Check matrix row for 1s to find neighbors [OK]

Common Mistakes:

• Confusing row and column indices
• Printing vertex itself as neighbor
• Misreading matrix values

4. The following code attempts to create an adjacency list for a graph with 3 vertices but has an error:

int* graph[3];
for (int i = 0; i < 3; i++) {
  graph[i] = malloc(sizeof(int));
  graph[i][0] = i;
}

What is the main issue?

medium

A. Array size should be 4 instead of 3

B. Using malloc instead of calloc

C. Memory allocated is too small for multiple neighbors

D. graph should be declared as int graph[3][3]

Solution

1. Step 1: Check memory allocation size

   malloc(sizeof(int)) allocates space for only one int, but adjacency list needs space for multiple neighbors.

2. Step 2: Understand adjacency list needs dynamic size

   Allocating only one int is insufficient; should allocate enough space or use dynamic structures like linked lists.

3. Final Answer:

   Memory allocated is too small for multiple neighbors -> Option C

4. Quick Check:

   Insufficient malloc size = Error [OK]

Hint: Allocate enough memory for all neighbors in adjacency list [OK]

Common Mistakes:

• Confusing malloc and calloc
• Wrong array declaration type
• Assuming fixed size adjacency list

5. You have a graph with 1000 vertices and about 10,000 edges. You want to quickly check if an edge exists between any two vertices. Which representation is best and why?

hard

A. Adjacency List, because it uses less memory for sparse graphs

B. Adjacency Matrix, because it allows O(1) edge existence check

C. Edge List, because it is easiest to implement

D. Incidence Matrix, because it stores edges explicitly

Solution

1. Step 1: Analyze graph size and density

   1000 vertices and 10,000 edges means the graph is moderately dense (max edges ~499,500).

2. Step 2: Consider edge existence check speed

   Adjacency matrix allows checking edge existence in O(1) time by direct index access.

3. Step 3: Compare memory vs speed tradeoff

   Though adjacency matrix uses more memory, fast edge check is priority here.

4. Final Answer:

   Adjacency Matrix, because it allows O(1) edge existence check -> Option B

5. Quick Check:

   Fast edge check = Adjacency Matrix [OK]

Hint: Need fast edge check? Use adjacency matrix despite memory [OK]

Common Mistakes:

• Choosing adjacency list only for memory without speed need
• Ignoring graph density impact
• Confusing edge list with adjacency matrix