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

Time Complexity: Adjacency List vs Matrix When to Choose Which

O(n^2) for matrix, O(n + e) for list

Understanding Time Complexity

Choosing how to represent a graph affects how fast we can check connections and add edges.

We want to know how the time to do these tasks grows as the graph gets bigger.

Scenario Under Consideration

Analyze the time complexity of these two graph representations.

// Adjacency Matrix
const matrix = Array(n).fill(null).map(() => Array(n).fill(0));
// Add edge
matrix[u][v] = 1;

// Adjacency List
const list = Array(n).fill(null).map(() => []);
// Add edge
list[u].push(v);

This code shows how to add edges using adjacency matrix and adjacency list.

Identify Repeating Operations

Look at what repeats when we check or add edges.

• Primary operation: Accessing or updating connections between nodes.
• How many times: For matrix, checking all pairs is n×n; for list, checking neighbors depends on edges.

How Execution Grows With Input

As nodes (n) grow, matrix operations involve n² checks, list operations depend on edges (e).

Input Size (n)	Approx. Operations (Matrix)	Approx. Operations (List)
10	100 (10x10)	Depends on edges, e.g. 20
100	10,000 (100x100)	Depends on edges, e.g. 200
1000	1,000,000 (1000x1000)	Depends on edges, e.g. 2000

Matrix grows with square of nodes; list grows with number of edges, often less than n².

Final Time Complexity

Time Complexity: O(n²) for adjacency matrix, O(n + e) for adjacency list

Matrix is slower for large graphs because it checks all pairs; list is faster when edges are fewer.

Common Mistake

[X] Wrong: "Adjacency matrix is always better because it uses simple arrays."

[OK] Correct: Matrix wastes time and space when graph has few edges; list is more efficient then.

Interview Connect

Understanding these differences helps you pick the right graph style for problems, showing good problem-solving skills.

Self-Check

"What if the graph is dense with many edges? How would the time complexity of adjacency list compare to adjacency matrix?"

Practice

1. Which data structure is generally better for representing a graph with many nodes but few edges?

easy

A. Adjacency Matrix

B. Adjacency List

C. Array

D. Stack

Solution

1. Step 1: Understand graph density

   A graph with many nodes but few edges 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.

3. Final Answer:

   Adjacency List -> Option B

4. Quick Check:

   Sparse graph = Adjacency List [OK]

Hint: Sparse graphs use adjacency lists for space efficiency [OK]

Common Mistakes:

• Choosing adjacency matrix for sparse graphs wastes space
• Confusing adjacency list with adjacency matrix
• Thinking arrays or stacks represent graphs directly

2. Which of the following is the correct syntax to initialize an empty adjacency list for a graph with 3 nodes in JavaScript?

easy

A. const graph = [[], [], []];

B. const graph = [[0,0,0],[0,0,0],[0,0,0]];

C. const graph = new Array(3).fill([]);

D. const graph = {};

Solution

1. Step 1: Understand adjacency list structure

   An adjacency list is an array where each element is an array of neighbors.

2. Step 2: Check each option

   const graph = [[], [], []]; creates separate empty arrays for each node. const graph = new Array(3).fill([]); fills with the same array reference, causing bugs.

3. Final Answer:

   const graph = [[], [], []]; -> Option A

4. Quick Check:

   Separate empty arrays = const graph = [[], [], []]; [OK]

Hint: Use separate empty arrays, not fill with one array [OK]

Common Mistakes:

• Using fill([]) which shares the same array reference
• Using adjacency matrix syntax for adjacency list
• Using an object instead of array for adjacency list

3. What will be the output of the following JavaScript code snippet?

const graph = [
  [1, 2],
  [0],
  [0]
];
console.log(graph[0]);

medium

A. [0, 1, 2]

B. [0]

C. [1, 2]

D. undefined

Solution

1. Step 1: Understand the adjacency list structure

   graph[0] contains the neighbors of node 0, which are nodes 1 and 2.

2. Step 2: Check the console.log output

   Logging graph[0] prints the array [1, 2].

3. Final Answer:

   [1, 2] -> Option C

4. Quick Check:

   graph[0] = [1, 2] [OK]

Hint: Access adjacency list by index to get neighbors [OK]

Common Mistakes:

• Confusing adjacency list with adjacency matrix output
• Expecting all nodes instead of neighbors
• Mistaking graph[0] as undefined

4. Identify the error in this adjacency matrix initialization code for a graph with 3 nodes:

const graph = new Array(3).fill(new Array(3).fill(0));
graph[0][1] = 1;
console.log(graph);

medium

A. The inner arrays are shared references causing all rows to change

B. The graph array is not initialized with zeros

C. The syntax for new Array is incorrect

D. The assignment graph[0][1] = 1 is invalid

Solution

1. Step 1: Analyze array initialization

   Using fill with new Array(3).fill(0) creates one inner array shared by all rows.

2. Step 2: Effect of modifying graph[0][1]

   Changing graph[0][1] changes the same element in all rows because they reference the same array.

3. Final Answer:

   The inner arrays are shared references causing all rows to change -> Option A

4. Quick Check:

   Shared inner arrays cause unexpected changes [OK]

Hint: Use loop or map to create separate inner arrays [OK]

Common Mistakes:

• Assuming fill creates independent arrays
• Ignoring shared reference problem
• Thinking syntax is wrong instead of logic

5. You have a graph with 1000 nodes and about 10,000 edges. Which representation is more efficient in terms of memory and why? Choose the best option.

hard

A. Adjacency Matrix, because it allows O(1) edge checks

B. Adjacency List, because it stores all possible edges

C. Adjacency Matrix, because it is simpler to implement

D. Adjacency List, because it uses memory proportional to edges

Solution

1. Step 1: Calculate graph density

   Maximum edges for 1000 nodes is 1,000,000 (1000*1000). 10,000 edges is sparse.

2. Step 2: Compare memory usage

   Adjacency matrix uses memory for all possible edges (1,000,000). Adjacency list uses memory proportional to actual edges (10,000).

3. Step 3: Choose efficient representation

   Adjacency list is more memory efficient for sparse graphs.

4. Final Answer:

   Adjacency List, because it uses memory proportional to edges -> Option D

5. Quick Check:

   Sparse graph = Adjacency List memory efficient [OK]

Hint: Sparse large graph? Use adjacency list for memory [OK]

Common Mistakes:

• Choosing adjacency matrix for sparse graphs wastes memory
• Confusing simplicity with efficiency
• Thinking adjacency list stores all possible edges