Adjacency List vs Matrix When to Choose Which in DSA Typescript - Why the Distinction Matters

The Big Idea

Discover how a simple choice in storing connections can make your programs lightning fast or painfully slow!

The Scenario

Imagine you want to keep track of friendships in a large school. You try to write down every possible pair of students and whether they are friends or not on a big sheet of paper.

This sheet quickly becomes huge and hard to manage, especially when most students only have a few friends.

The Problem

Writing down every possible connection wastes a lot of space and time. It becomes slow to find who is friends with whom because you have to look through many empty spots.

Also, updating the list when friendships change is tiring and error-prone.

The Solution

Using an adjacency list, you only write down the friends each student actually has. This saves space and makes it faster to find and update friendships.

For smaller groups or when you need to quickly check if two students are friends, an adjacency matrix works well because it gives instant answers.

Before vs After

✗ Before

const matrix = Array(numStudents).fill(0).map(() => Array(numStudents).fill(false));
matrix[0][1] = true; // Mark friendship
// Checking friendship requires direct access

✓ After

const adjacencyList: Map<number, number[]> = new Map();
adjacencyList.set(0, [1]); // Student 0 is friends with 1
// Checking friendship by looking up list of friends

What It Enables

Choosing the right way to store connections lets you handle big or small networks efficiently and keeps your program fast and simple.

Real Life Example

Social media platforms use adjacency lists to store user connections because most users have a limited number of friends, saving huge amounts of memory.

But for small games or puzzles where quick checks of connections are needed, adjacency matrices are preferred.

Key Takeaways

Adjacency lists save space when connections are few.

Adjacency matrices give quick answers for dense connections.

Choosing the right one depends on the size and type of your network.

Practice

1. Which data structure is generally more space-efficient 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

   Sparse graphs have few edges compared to vertices, so storing all possible edges wastes space.

2. Step 2: Compare space usage of adjacency list and matrix

   Adjacency list stores only existing edges, using less space for sparse graphs. Adjacency matrix always uses 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 less space [OK]

Common Mistakes:

• Choosing adjacency matrix for sparse graphs
• Confusing edge count with vertex count
• Ignoring space complexity differences

2. Which of the following is the correct TypeScript syntax to declare an adjacency matrix for a graph with 3 vertices initialized with zeros?

easy

A. const matrix: number[][] = new Array(3).fill(new Array(3).fill(0));

B. const matrix: number[] = [0,0,0];

C. const matrix: number[][] = [[0,0,0],[0,0,0],[0,0,0]];

D. const matrix: number[][] = Array(3).map(() => Array(3).fill(0));

Solution

1. Step 1: Understand adjacency matrix type

   An adjacency matrix is a 2D array (array of arrays) of numbers representing edges.

2. Step 2: Check initialization correctness

   const matrix: number[][] = [[0,0,0],[0,0,0],[0,0,0]]; explicitly creates a 3x3 matrix with zeros. const matrix: number[][] = new Array(3).fill(new Array(3).fill(0)); uses fill with the same inner array reference, causing bugs. const matrix: number[][] = Array(3).map(() => Array(3).fill(0)); uses map on empty array, which won't work as expected. const matrix: number[] = [0,0,0]; is 1D array, not matrix.

3. Final Answer:

   const matrix: number[][] = [[0,0,0],[0,0,0],[0,0,0]]; -> Option C

4. Quick Check:

   Explicit 2D array with zeros = const matrix: number[][] = [[0,0,0],[0,0,0],[0,0,0]]; [OK]

Hint: Use explicit 2D array for adjacency matrix initialization [OK]

Common Mistakes:

• Using fill with nested arrays causing shared references
• Declaring 1D array instead of 2D
• Using map on empty array without initialization

3. Given the following adjacency list representation of a graph in TypeScript:

const graph = {
  0: [1, 2],
  1: [2],
  2: [0, 3],
  3: []
};
console.log(graph[2]);

What will be the output?

medium

A. [2]

B. [1, 2]

C. undefined

D. [0, 3]

Solution

1. Step 1: Identify the adjacency list for vertex 2

   In the graph object, key '2' maps to the array [0, 3].

2. Step 2: Understand console.log output

   Logging graph[2] prints the array [0, 3] representing edges from vertex 2.

3. Final Answer:

   [0, 3] -> Option D

4. Quick Check:

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

Hint: Access adjacency list by vertex key to get connected nodes [OK]

Common Mistakes:

• Confusing keys and values in adjacency list
• Expecting adjacency matrix output
• Assuming undefined for existing keys

4. Consider this TypeScript code snippet for creating an adjacency matrix for a graph with 3 vertices:

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

What is the problem with this code?

medium

A. All rows refer to the same inner array, so all rows change when one element changes

B. The matrix is not initialized with zeros

C. The matrix is not a 2D array

D. The size variable is not used correctly

Solution

1. Step 1: Analyze the fill method usage

   Using fill with new Array(size).fill(0) creates one inner array and fills outer array with references to the same inner array.

2. Step 2: Understand effect of modifying one element

   Changing matrix[0][1] changes that element in all rows because they share the same inner array reference.

3. Final Answer:

   All rows refer to the same inner array, so all rows change when one element changes -> Option A

4. Quick Check:

   Shared inner array reference causes unexpected changes [OK]

Hint: Avoid fill with nested arrays; use map to create separate arrays [OK]

Common Mistakes:

• Thinking fill creates separate inner arrays
• Ignoring shared reference problem
• Assuming matrix is 1D array

5. You need to represent a dense graph with 1000 vertices where you frequently check if an edge exists between any two vertices. Which representation is best and why?

hard

A. Adjacency List, because it uses less space for dense graphs

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

C. Edge List, because it is fastest for dense graphs

D. Incidence Matrix, because it uses less space than adjacency matrix

Solution

1. Step 1: Understand graph density and operation needs

   Dense graph means many edges; checking edge existence frequently requires fast lookup.

2. Step 2: Compare adjacency list and matrix for edge checks

   Adjacency matrix allows direct O(1) access to check if edge exists between two vertices. Adjacency list requires searching neighbors, which can be slower in dense graphs.

3. Step 3: Consider space tradeoff

   Though adjacency matrix uses more space, for dense graphs this is acceptable and beneficial for speed.

4. Final Answer:

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

5. Quick Check:

   Dense graph + frequent edge check = Adjacency Matrix [OK]

Hint: Dense graph + frequent edge check? Use adjacency matrix [OK]

Common Mistakes:

• Choosing adjacency list for dense graphs needing fast edge checks
• Ignoring time complexity of edge existence queries
• Confusing edge list with adjacency matrix benefits