**CAT DILR Mastery: Routes, Networks & Maps – The 99%ile Study Guide**

CAT DILR Mastery: Routes, Networks & Maps – The 99%ile Study Guide

What This Is

Routes, Networks & Maps (RNM) is a high-frequency, high-scoring DILR topic in CAT, appearing 2-3 times per paper (often in Sets 3-4). It tests spatial reasoning, logical sequencing, and optimization—skills that separate 95%ilers from 99%ilers.

Why it matters:
- Low-hanging fruit: Unlike complex LR sets, RNM questions often have clear patterns (e.g., shortest path, circular routes, one-way streets).
- Time-efficient: A well-practiced student can solve a 3-question RNM set in 8-10 minutes (vs. 12-15 for other DILR sets).
- Real CAT example:

"A delivery agent must visit 5 cities (A, B, C, D, E) connected by one-way roads. The roads are: A→B, A→C, B→D, C→D, D→E. What is the minimum number of roads needed to travel from A to E?" (Answer: 3 – A→B→D→E or A→C→D→E)

Master this, and you’ll bank 6-9 marks per paper with near-100% accuracy.

Key Concepts & Techniques

1. Graph Representation (Nodes & Edges)

• What it is: Convert the problem into a directed/undirected graph where:
• Nodes = Locations (cities, junctions, rooms).
• Edges = Paths/roads (one-way or two-way).
• When to use: Every RNM problem—draw the graph first before solving.
• Pro tip: Label edges with distances/costs if given (e.g., "A→B: 5 km").

2. Shortest Path (BFS/Dijkstra’s Lite)

• What it is: Find the minimum steps/cost from start to end.
• When to use: Questions asking for "minimum roads", "least time", or "cheapest route".
• How:
• Breadth-First Search (BFS): For unweighted graphs (equal edge costs).
• Dijkstra’s Lite: For weighted graphs (vary edge costs). CAT rarely tests full Dijkstra’s—just track cumulative costs.
• Example: In the CAT example above, BFS from A gives the shortest path to E in 3 steps.

3. Eulerian/Hamiltonian Paths

• Eulerian Path: Visits every edge exactly once (e.g., "Can you traverse all roads without retracing?").
• Rule: A graph has an Eulerian path if 0 or 2 nodes have odd degree.
• Hamiltonian Path: Visits every node exactly once (e.g., "Can you visit all cities without revisiting any?").
• No shortcut rule—trial and error is needed.
• When to use:
• Eulerian: Questions about traversing all roads (e.g., garbage collection routes).
• Hamiltonian: Questions about visiting all locations (e.g., salesman routes).

4. Circular/Loop Constraints

• What it is: Some paths form loops (e.g., "A→B→C→A").
• When to use: Questions with restrictions like "no revisiting" or "must return to start".
• Key insight:
• If a loop exists, infinite paths are possible (e.g., A→B→C→A→B→C→...).
• Trap: CAT may ask for "unique" paths—ignore loops unless specified.

5. One-Way vs. Two-Way Roads

• One-way: Direction matters (e.g., "A→B" ≠ "B→A").
• Two-way: Bidirectional (e.g., "A—B" = "B—A").
• When to use: Always check the problem statement—misreading this is a top 3 mistake.
• Pro tip: Draw arrows for one-way roads to avoid confusion.

6. Permutation of Routes

• What it is: If multiple paths exist, count all valid permutations.
• When to use: Questions like "How many ways can you go from X to Y?".
• How:
• Break the path into segments (e.g., A→B→D→E has 2 segments: A→B and B→D).
• Multiply the number of choices per segment (e.g., 2 choices for A→D, 1 for D→E → 2 total paths).

7. Constraints & Elimination

• What it is: Use given conditions to rule out invalid paths.
• When to use: Questions with restrictions (e.g., "Cannot go from B to C").
• How:
• Cross out forbidden edges on your graph.
• Recalculate paths only using allowed edges.

8. Matrix Representation (Adjacency Matrix)

• What it is: A table showing connections between nodes.
• Row = From, Column = To.
• 1 = Path exists, 0 = No path.
• When to use: For large networks (5+ nodes) where drawing a graph is messy.
• Example:
  | | A | B | C | D |
  |---|---|---|---|---|
  | A | 0 | 1 | 1 | 0 |
  | B | 0 | 0 | 0 | 1 |
  | C | 0 | 0 | 0 | 1 |
  | D | 0 | 0 | 0 | 0 |
  (This matches the CAT example above.)

Step-by-Step Strategy (The 5-Step RNM Solver)

Follow this for every RNM question:

Step 1: Draw the Graph (30 sec)

• Action: Sketch nodes (circles) and edges (lines/arrows).
• Key: Label one-way vs. two-way clearly.
• Example: For the CAT example, draw: A → B → D → E ↓ C → D

Step 2: Identify the Question Type (10 sec)

• Action: Ask: "What is being asked?"
• Shortest path? → BFS/Dijkstra’s Lite.
• Number of paths? → Permutation of routes.
• Traverse all roads? → Eulerian path.
• Visit all cities? → Hamiltonian path.

Step 3: Apply the Right Technique (1-2 min)

• Action: Use the Key Concept from above that matches the question type.
• Example: For the CAT example (shortest path), use BFS:
• Start at A → Explore B and C (1 step).
• From B → D (2 steps).
• From C → D (2 steps).
• From D → E (3 steps).
• Answer = 3.

Step 4: Check for Constraints (20 sec)

• Action: Re-read the problem for hidden rules (e.g., "Cannot revisit B").
• Key: Cross out invalid paths on your graph.

Step 5: Verify with Answer Choices (10 sec)

• Action: If MCQ, eliminate options that violate constraints or logic.
• Example: If options are 2, 3, 4, 5, and you found 3, 3 is correct.

Fully Worked CAT-Style Example

Question: A courier must deliver packages to 4 offices (P, Q, R, S) connected by one-way roads: - P → Q, P → R, Q → R, Q → S, R → S.
Constraints: 1. The courier starts at P.
2. Cannot revisit any office.
3. Must end at S.
Question: How many unique paths exist from P to S?

Step 1: Draw the Graph

P → Q → R → S
↓   ↓
R → S

Step 2: Identify Question Type

• "How many unique paths?" → Permutation of routes.
• "Cannot revisit" → No loops allowed.

Step 3: Apply Technique (List All Paths)

• Path 1: P → Q → R → S
• Path 2: P → Q → S
• Path 3: P → R → S
• Check for others:
• P → Q → R → S (already counted).
• P → R → Q → S → Invalid (Q→R is allowed, but R→Q doesn’t exist).
• P → Q → P → ... → Invalid (revisits P).

Step 4: Check Constraints

• All paths start at P, end at S, and no revisits → All 3 are valid.

Step 5: Verify

• Answer = 3.

Common Mistakes

CAT Traps & Time Management

Trap 1: "All Roads" vs. "All Cities"

• Trap: Confusing Eulerian (all roads) with Hamiltonian (all cities).
• Avoid: Ask: "Does the question say 'traverse all roads' or 'visit all cities'?"

Trap 2: Implicit Constraints

• Trap: Problems may imply "no revisits" (e.g., "delivery route").
• Avoid: Assume no revisits unless stated otherwise.

Trap 3: Weighted vs. Unweighted Graphs

• Trap: Treating all edges as equal when distances/costs are given.
• Avoid: Always check for weights—use Dijkstra’s Lite if needed.

Time Guide

Quick Practice

Question: A metro map has 5 stations (A, B, C, D, E) with one-way tracks: - A → B, A → C, B → D, C → D, D → E, E → A.
Question: What is the minimum number of tracks needed to go from A to D without revisiting any station? Answer: 2 (A→B→D or A→C→D).
Solution Path: BFS from A → D is reachable in 2 steps.

Last-Minute Cram Sheet (10 One-Liners)

1. Always draw the graph first—even if it’s messy.
2. One-way roads = arrows; two-way = lines.
3. Shortest path = BFS (unweighted) or Dijkstra’s Lite (weighted).
4. Eulerian path: 0 or 2 odd-degree nodes.
5. Hamiltonian path: No shortcut—trial and error.
6. "Cannot revisit" = no loops—cross out invalid paths.
7. Permutation of routes: Multiply choices per segment.
8. Adjacency matrix: Rows = from, columns = to.
9. Trap: "All roads" ≠ "all cities"—read carefully!
10. Time limit: 2-3 min per question—move on if stuck.

Final Tip: RNM is pattern-based—do 10-15 problems from past CAT papers (2017-2023) to spot recurring structures. Accuracy > speed—but with practice, both will improve.