Adjacency List vs Matrix When to Choose Which in DSA Javascript - Key Differences

Recall & Review

beginner

What is an adjacency list in graph representation?

An adjacency list stores each node with a list of its connected neighbors. It is like a list of friends for each person in a social network.

beginner

What is an adjacency matrix in graph representation?

An adjacency matrix is a 2D grid where rows and columns represent nodes. A cell is marked if there is a connection between the nodes at that row and column.

intermediate

When is it better to use an adjacency list over a matrix?

Use an adjacency list when the graph has fewer edges (sparse graph). It saves space and is faster to find neighbors.

intermediate

When should you choose an adjacency matrix?

Choose an adjacency matrix when the graph is dense (many edges) or when you need to quickly check if two nodes are connected.

intermediate

What is a key difference in memory use between adjacency list and matrix?

Adjacency lists use memory proportional to edges, so less for sparse graphs. Matrices always use memory proportional to the square of nodes, which can be large.

Which graph representation is more memory efficient for a graph with 1000 nodes and 10,000 edges?

A Depends on node values

B Adjacency matrix

C Both use the same memory

D Adjacency list

Adjacency list uses memory proportional to edges, which is less for sparse graphs like this.

Which representation allows faster check if two nodes are directly connected?

A Adjacency list

B Adjacency matrix

C Both are equally fast

D Depends on graph size

Adjacency matrix allows O(1) time to check connection by looking at a cell.

For a dense graph, which representation is generally preferred?

A Adjacency matrix

B None

C Edge list

D Adjacency list

Adjacency matrix is better for dense graphs because it stores all connections explicitly.

Which representation is easier to iterate over all neighbors of a node?

A Both are equally easy

B Adjacency matrix

C Adjacency list

D Depends on node degree

Adjacency list directly stores neighbors, making iteration simple and efficient.

If you want to add or remove edges frequently, which representation is better?

A Adjacency list

B Adjacency matrix

C Both are equally good

D Depends on number of nodes

Adjacency lists allow easier and faster updates for adding or removing edges.

Explain when and why you would choose an adjacency list over an adjacency matrix for graph representation.

Think about graphs with few connections compared to nodes.

Describe the advantages of using an adjacency matrix and situations where it is preferred.

Consider graphs with many edges and quick lookups.

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