Why Shortest Path Is a Graph Problem Not a Tree Problem in DSA Typescript - Quick Recap

Recall & Review

beginner

What is a key difference between a tree and a graph?

A tree is a special type of graph with no cycles and exactly one path between any two nodes, while a graph can have cycles and multiple paths between nodes.

beginner

Why can't shortest path problems be solved using trees alone?

Because shortest path problems often involve multiple paths and cycles, which trees do not have, so graphs are needed to represent all possible routes.

intermediate

What does the presence of cycles in a graph imply for shortest path calculations?

Cycles mean there can be multiple routes between nodes, so algorithms must consider all paths to find the shortest one, which is not possible in trees since they have no cycles.

beginner

How does a graph represent real-world networks better than a tree?

Graphs can represent complex connections with multiple paths and loops, like roads or internet networks, while trees only show hierarchical, one-path structures.

beginner

Name a common algorithm used to find the shortest path in graphs.

Dijkstra's algorithm is a popular method to find the shortest path in weighted graphs.

Which data structure allows multiple paths between nodes?

A Graph

B Tree

C Linked List

D Stack

Graphs can have multiple paths and cycles, unlike trees which have only one path between nodes.

Why is the shortest path problem not suited for trees?

A Trees are not connected

B Trees have cycles

C Trees have only one path between nodes

D Trees have weighted edges only

Trees have exactly one path between any two nodes, so shortest path problems that require multiple path options need graphs.

What feature of graphs makes shortest path algorithms necessary?

A Only one root node

B No edges

C Fixed hierarchy

D Presence of cycles and multiple paths

Cycles and multiple paths in graphs require algorithms to find the shortest route.

Which algorithm is commonly used to find shortest paths in graphs?

A Binary Search

B Dijkstra's algorithm

C Merge Sort

D Depth First Search

Dijkstra's algorithm efficiently finds shortest paths in weighted graphs.

In a tree, how many paths exist between two nodes?

A One

B Multiple

C Zero

D Depends on the tree

Trees have exactly one unique path between any two nodes.

Explain why shortest path problems require graphs instead of trees.

Think about how many ways you can travel between two points.

Describe how cycles in graphs affect shortest path calculations.

Consider what happens if you can go around in circles.

Practice

1. Why is finding the shortest path usually considered a graph problem rather than a tree problem?

easy

A. Because shortest path algorithms only work on trees.

B. Because trees do not have nodes or edges.

C. Because trees always have negative edge weights.

D. Because graphs can have cycles and multiple paths between nodes, unlike trees.

Solution

1. Step 1: Understand the structure of trees and graphs

   Trees are a special type of graph with no cycles and exactly one path between any two nodes.

2. Step 2: Analyze shortest path requirements

   Shortest path problems require handling multiple paths and cycles, which only general graphs can have.

3. Final Answer:

   Because graphs can have cycles and multiple paths between nodes, unlike trees. -> Option D

4. Quick Check:

   Graphs allow multiple paths [OK]

Hint: Shortest path needs multiple paths; trees have only one [OK]

Common Mistakes:

• Thinking trees have cycles
• Assuming shortest path only applies to trees
• Confusing nodes and edges in trees

2. Which of the following TypeScript code snippets correctly declares a graph adjacency list for shortest path calculation?

easy

A. const graph: Map = new Map();

B. const graph: number[][] = []; graph[0] = 1;

C. const graph: string = 'adjacency list';

D. const graph: number = 0;

Solution

1. Step 1: Identify correct graph adjacency list type

   An adjacency list for a graph is best represented as a Map from node to array of connected nodes.

2. Step 2: Check code correctness

   const graph: Map = new Map(); uses Map which is correct. const graph: number[][] = []; graph[0] = 1; assigns a number to an array index incorrectly. Options C and D use wrong types.

3. Final Answer:

   const graph: Map<number, number[]> = new Map(); -> Option A

4. Quick Check:

   Map with arrays [OK]

Hint: Use Map for adjacency lists [OK]

Common Mistakes:

• Using wrong data types for graph
• Assigning values directly to array index without initialization
• Confusing string or number types for graph

3. Given the following graph represented as adjacency list, what is the shortest path distance from node 0 to node 3?

const graph = new Map([
  [0, [1, 2]],
  [1, [2, 3]],
  [2, [3]],
  [3, []]
]);

// Assume each edge has weight 1
// Use BFS to find shortest path distance

medium

A. 1

B. 2

C. 3

D. 4

Solution

1. Step 1: Trace BFS from node 0 to node 3

   From 0, neighbors are 1 and 2 (distance 1). From 1, neighbors include 3 (distance 2). From 2, neighbor is 3 (distance 2).

2. Step 2: Determine shortest distance

   Shortest path is 0 -> 1 -> 3 or 0 -> 2 -> 3, both length 2.

3. Final Answer:

   2 -> Option B

4. Quick Check:

   Shortest path length = 2 [OK]

Hint: BFS finds shortest path in unweighted graph [OK]

Common Mistakes:

• Counting edges incorrectly
• Confusing path length with number of nodes
• Ignoring multiple paths

4. Identify the bug in this TypeScript code snippet for shortest path in a graph and select the fix:

function shortestPath(graph: Map, start: number, end: number): number {
  const queue: number[] = [start];
  const distances: Map = new Map();
  distances.set(start, 0);

  while (queue.length > 0) {
    const node = queue.shift();
    for (const neighbor of graph.get(node)!) {
      if (!distances.has(neighbor)) {
        distances.set(neighbor, distances.get(node)! + 1);
        queue.push(neighbor);
      }
    }
  }
  return distances.get(end)!;
}

medium

A. Change queue.shift() to queue.pop() to get correct order.

B. Remove the exclamation marks (!) to avoid errors.

C. Add check if node is undefined after shift before using it.

D. Initialize distances with Infinity for all nodes before starting.

Solution

1. Step 1: Analyze queue.shift() usage

   queue.shift() can return undefined if queue is empty, but loop condition prevents that. However, TypeScript needs explicit check for undefined.

2. Step 2: Fix by checking node is not undefined

   Adding a check after shift ensures safe usage of node in graph.get(node).

3. Final Answer:

   Add check if node is undefined after shift before using it. -> Option C

4. Quick Check:

   Check for undefined after shift [OK]

Hint: Always check shift() result before use in TypeScript [OK]

Common Mistakes:

• Using pop() breaks BFS order
• Ignoring possible undefined from shift()
• Misunderstanding exclamation mark usage

5. You want to find the shortest path in a network where some edges have negative weights but no negative cycles. Why is this a graph problem and which algorithm suits best?

hard

A. Because graphs can have cycles and negative edges; use Bellman-Ford algorithm.

B. Because trees cannot have negative weights; use Dijkstra's algorithm.

C. Because trees always have positive weights; use BFS.

D. Because graphs with negative edges are invalid; no algorithm applies.

Solution

1. Step 1: Understand edge weights and graph structure

   Negative edge weights and cycles can only appear in graphs, not trees.

2. Step 2: Choose suitable algorithm

   Dijkstra's algorithm fails with negative edges; Bellman-Ford handles negative weights and detects negative cycles.

3. Final Answer:

   Because graphs can have cycles and negative edges; use Bellman-Ford algorithm. -> Option A

4. Quick Check:

   Negative edges + cycles = Bellman-Ford [OK]

Hint: Negative edges? Use Bellman-Ford on graphs [OK]

Common Mistakes:

• Using Dijkstra with negative edges
• Thinking trees can have negative edges
• Assuming no algorithm works with negative edges