Network Diagrams — Complete Guide for CAT, MBA CET, NMAT, SNAP & Other Competitive Exams

Q: What is a network diagram?

A network diagram is a visual or structural representation consisting of entities (called nodes or vertices) and the interconnections between them (called edges or links). In logical reasoning, it models transport routes, communication channels, workflow pipelines, and organizational hierarchies.

Q: What is the difference between a node and an edge?

A node (or vertex) represents an individual entity, state, city, person, or workstation. An edge (or link) represents the physical or logical relationship, road, flight, pipeline, or communication cable connecting two nodes.

Q: What is the difference between a direct connection and a path?

A direct connection is a single edge linking two nodes with no intermediate stops (e.g., A—B). A path is an alternating sequence of nodes and edges connecting an origin to a destination through zero, one, or more intermediate nodes (e.g., A—C—D—B).

Q: How do I identify a directed network?

A directed network features arrows on its edges indicating one-way flow or strict orientation (e.g., A → B). Travel is permitted strictly in the arrow's direction. If an edge has arrows at both ends or no arrowheads, traversal is bidirectional (undirected).

Q: How do I count paths without double-counting?

Use systematic tree enumeration or topological node-value propagation: start from the source, list each outgoing branch systematically, record visited nodes to avoid cyclic loops, and branch out recursively until the destination is reached.

Q: Is the shortest path always the cheapest path?

No. The path with the fewest edges (fewest hops) is not necessarily the path with the lowest total weight, time, or cost. In weighted networks, a multi-hop route with low individual edge weights often costs significantly less than a direct single-edge route with a high toll.

Q: What is a disconnected network?

A disconnected network is a network divided into two or more separate components where no sequence of edges connects a node in one component to a node in another. Nodes in separate components have zero reachability between each other.

Q: How do I solve network questions quickly in an exam?

First, list or verify the formal edge list to avoid visual illusions. Mark one-way arrows prominently. Identify prohibited nodes or mandatory checkpoints early to disqualify invalid routes. For weighted routes, calculate candidates in an organized table rather than mentally estimating.

Home / The Bodhi Vault / LR Vault / Network Diagrams

SECTION A • CONCEPT FOUNDATION

Introduction to Network Diagrams

01. ONE-LINE DEFINITION

Structural Interconnections

A network diagram is a visual or tabular graph of discrete entities (nodes) linked by relationship pathways (edges), representing routes, data flows, communication, or process dependencies.

02. WHY IT MATTERS

Route & Flow Mastery

Competitive exams test your ability to convert complex word conditions into clean connection graphs, trace routes under strict constraints, count paths without omission, and identify bottlenecks.

03. WHERE IT IS USED

Target Exam Spectrum

Tested extensively in CAT DILR (multi-stage pipelines, capacity networks), XAT Decision Making (supply chains), MAH MBA CET (route counts, direction grids), SNAP, and NMAT.

04. PREREQUISITES

Basic Reasoning Tools

Requires basic set logic, systematic case counting, addition of route costs, and disciplined adherence to one-way arrows without making unjustified spatial assumptions.

05. CORE INTUITION

Connectivity Over Geometry

Spatial coordinates do not matter; topological connectivity does. Two nodes are connected if and only if an explicit edge links them. A crossing of lines on paper does NOT create an intersection or a node unless a junction vertex is explicitly labeled.

STARTER NETWORK DEMONSTRATION Sample Metro Line Setup

Consider a simple four-city regional bus service connecting nodes A, B, C, and D. The available bus routes are: A — B (two-way), A — C (two-way), B — D (two-way), and C — D (two-way).

A ←—→ B

Direct Link (1 Hop)

A ←—→ C

Direct Link (1 Hop)

B ←—→ D

Direct Link (1 Hop)

C ←—→ D

Direct Link (1 Hop)

Basic Network Observations

Nodes: Exactly 4 nodes: {A, B, C, D}.

Total Edges: Exactly 4 edges: {A-B, A-C, B-D, C-D}.

Direct Connection between A and D? No. There is no edge directly joining A and D.

Can a passenger travel from A to D? Yes, via two distinct simple routes: A → B → D or A → C → D (each taking 2 hops).

Key Lesson: A path can exist between two nodes even when no direct edge connects them. To reach D from A, you must traverse an intermediate junction (either B or C).

SECTION B • GRAPH ANATOMY

Essential Components of a Network

Every network puzzle in CAT and MBA exams is built from basic structural building blocks. Understanding standard terminology prevents costly misinterpretations.

1. Nodes & Edges

Node (Vertex): The discrete points representing locations, people, stages, or servers.

Edge (Arc / Link): The line connecting two nodes. An edge is denoted as a pair (u, v).

2. Direct vs Indirect Connections

Direct Connection: An unbroken single edge (u, v) with no intermediate vertices.

Indirect Connection: Reachability through one or more intermediate nodes: u → w → v.

→

3. Directed vs Undirected Networks

Undirected: Edges are bidirectional (A — B). Travel is legal in both directions.

Directed: Edges possess arrows (A → B). Travel from B to A is strictly illegal unless a reverse arrow exists.

≠

4. Connected vs Disconnected Networks

Connected: A path exists between every single pair of nodes in the graph.

Disconnected: Split into two or more isolated clusters. No path can cross between separate components.

∞

5. Paths, Cycles & Loops

Simple Path: A sequence of edges visiting no vertex more than once (A → B → C).

Cycle (Loop): A closed circuit where starting and ending nodes coincide (A → B → C → A).

deg

6. Degree of a Node

Total Degree (Undirected): Number of edges touching the node.

In-Degree (Directed): Number of arrows pointing INTO the node.
Out-Degree (Directed): Number of arrows pointing OUT of the node.

Edge Weights & Boundary Terminals

Edge Weights Numerical values attached to edges: distance (km), toll cost ($), travel time (mins), or pipe throughput capacity.

Source / Start Node A designated initial node. In directed pipelines, often has in-degree = 0 (no incoming flows).

Sink / Terminal Node A designated destination or dead end. In directed networks, often has out-degree = 0 (no exit edges).

SECTION C • ACCURACY PROTOCOLS

Reading and Interpreting Networks Correctly

Exams intentionally design network figures with overlapping lines, multiple converging arrows, and misleading geometries to test student vigilance. Master these 9 interpretation rules:

RULE 1

Identify Every Node Explicitly: Count vertices strictly by named labels or explicit dots. Never infer an unlabelled location.

RULE 2

Distinguish Direct Edges from Multi-Hop Routes: If A links to B and B links to C, do NOT assume A is directly connected to C. There must be an independent line (A, C).

RULE 3

Respect Arrow Orientations: If an edge is marked P → Q, you can only move from P to Q. Attempting to move from Q to P invalidates your route entirely.

RULE 4

Crossing Lines Do Not Form a Node: Two cables crossing like an 'X' on a diagram do not allow switching unless a junction node is explicitly drawn at the crossing point.

RULE 5

Count Connections Without Double-Counting: In an undirected graph with m edges, the sum of all node degrees equals exactly 2m (Handshaking Lemma): $\sum \text{deg}(v) = 2m$.

RULE 6

Audit Reachability Forward and Backward: In directed graphs, A reaching B does NOT imply B can reach A. Always trace in the direction of the arrows.

RULE 7

Identify Shared Convergence Points: If all paths from S to T must pass through node K, node K is a bottleneck / cut-vertex. Severing K destroys all connectivity between S and T.

SECTION D • TRAVERSAL DYNAMICS

Paths, Routes and Connectivity

Route analysis forms the backbone of CAT network reasoning. The table below categorizes the 10 core path phenomena:

Concept	Definition	Exam Implication
1. Direct Path	A path consisting of exactly 1 edge (u → v).	Immediate hop without layovers or transfers.
2. Multi-Step Path	A path containing 2 or more sequential edges.	Requires accumulating weights along every traversed leg.
3. Alternative Paths	Two or more distinct paths sharing the same start and end nodes.	Crucial for comparing costs, flight times, or backup detours.
4. Fewest-Edge Path	The path with the minimum count of traversed edges (minimum hops).	Minimizes stopovers, but NOT necessarily monetary cost or distance!
5. Reachability	Node B is reachable from A if at least one valid path exists from A to B.	If no path exists, reachability is false (unreachable).
6. Dead End (Sink)	A node with out-degree = 0 in a directed network.	Any path entering this node cannot proceed further.
7. Simple Path	A route where no node or edge is visited more than once.	Standard default in exams unless repeated visits are explicitly stated.
8. Connected Component	A maximal sub-network where every pair of nodes is mutually connected.	Used to detect isolated grids or severed power regions.
9. Directed Reachability	Path existence constrained by one-way arrow directions.	Asymmetric: A → B does not allow returning B → A.
10. Edge Count vs Weight	Fewest edges ≠ lowest weight.	CRITICAL DISTINCTION: Direct flight may cost $500; 2-hop route may cost $200!

⚠️ THE #1 CAT TRAP: FEWEST HOPS VS. MINIMUM WEIGHT

Students frequently assume that the route with the fewest edges is the optimal route. This is only true if edges are unweighted! In a weighted network, a 1-hop flight direct from City A to City B might cost $500, whereas a 3-hop route ($A \to C \to D \to B$) with flights costing $50 + $60 + $70 = $180 is far cheaper. Always verify whether the question asks for minimum hops or minimum total weight / cost.

SECTION E • COMBINATORIAL ENUMERATION

Network-Based Counting Techniques

Counting paths between nodes is one of the most common question formats in MBA CET, SNAP, and CAT. Follow these three tested enumeration methods:

Method 1: Branch Tree Enumeration

Best for small networks (4 to 7 nodes). Start at origin S, list every outgoing edge, and branch out systematically until reaching destination T or a dead end.

From A:
• Via B → D → T (Path 1)
• Via B → E → T (Path 2)
• Via C → T (Path 3)

Method 2: Multiplicative Multiplication

Applicable when a network is organized in sequential stages or layers with independent transitions between stages.

Stage 1 → Stage 2: m routes
Stage 2 → Stage 3: n routes
Total Paths = m × n

Method 3: Node-Value Dynamic Addition

For directed acyclic graphs (DAGs): assign value 1 to Start node. For each subsequent node, its value equals the sum of values of all nodes pointing directly into it.

$\text{Ways}(V) = \sum_{U \to V} \text{Ways}(U)$
Terminal node holds the exact total simple path count!

Minimum Connections for Connectivity (Spanning Trees)

A classic theoretical question asked in CET and NMAT: "What is the minimum number of links needed to connect n locations so that every location can communicate with every other location?"

Minimal Connected Graph (Tree):
For n vertices, exactly n − 1 edges are required to achieve full connectivity without creating redundant cycles.

Euler's Planar Formula (Single Component):
For any connected planar network: $\text{Vertices} - \text{Edges} + \text{Faces} = 2$.

SECTION F • ROUTE OPTIMIZATION

Weighted Networks and Route Selection

When numbers are attached to edges, each route acquires an aggregated metric: Total Distance, Total Cost, or Travel Time.

1. Summation Along a Route

For a path $P = (v_1, v_2, \dots, v_k)$, total weight $W(P)$ is simply the linear sum: $$\text{Weight}(P) = \sum_{i=1}^{k-1} w(v_i, v_{i+1})$$

2. Bottleneck (Minimax / Maximin) Flow

In fluid pipelines or data networks, throughput capacity along a route is limited strictly by the weakest link (minimum capacity edge): $$\text{Throughput}(P) = \min \{w(v_1, v_2), w(v_2, v_3), \dots, w(v_{k-1}, v_k)\}$$

Systematic Candidate Comparison Table

Route	Hops	Edge Weights	Total
A → B → D	2	12 + 18	30
A → C → D	2	14 + 11	25 ★
A → D (direct)	1	40	40

★ Optimal shortest route is A → C → D (25), even though A → D has fewer hops.

SECTION G • CONSTRAINT SATISFACTION

Handling Written Constraints & Conditions

Real exam sets rarely ask for unconditional paths; they introduce operational restrictions. Master how to translate written conditions directly into graph rules:

PROHIBITED NODES / EDGES Condition: "Town X is flooded and closed to all traffic."
Graph Action: Temporarily erase node X and all edges connected to X. Trace routes strictly through surviving vertices.

MANDATORY CHECKPOINT Condition: "The courier must stop at Depot K for customs clearance."
Graph Action: Split the route into two sub-problems: (1) Find paths from Start to K, and (2) Find paths from K to Destination. Multiply or concatenate the valid segments.

CAPACITY CEILING / FLOOR Condition: "Vehicle cargo load cannot exceed 5 tons; bridges under 5 tons are banned."
Graph Action: Disqualify any edge with capacity < 5.

MUTUALLY EXCLUSIVE VISITS Condition: "If Node P is visited, Node Q cannot be visited."
Graph Action: Partition route search into two disjoint buckets: (A) Routes containing P (exclude Q), and (B) Routes containing Q (exclude P).

SECTION H • EXAM EXECUTION PROTOCOL

The 10-Step Network Solving Protocol

Whenever you encounter a network diagram set in CAT or MBA CET, execute this exact 10-step protocol to prevent mistakes:

Step 01: Read the Question & Identify Target Count paths? Min weight? Min hops? Bottleneck?

Step 02: List Nodes and Connections Explicitly Convert visual sketch to a mental or scratch edge-list

Step 03: Mark Directions & One-Way Arrows Clearly Verify incoming vs outgoing orientation

Step 04: Translate Written Constraints Cross out prohibited nodes; circle mandatory checkpoints

Step 05: Identify Origin & Destination Terminals Fix start node S and target node T

Step 06: Trace Valid Routes Systematically Branch by first step: via Node 1, via Node 2...

Step 07: Eliminate Routes Violating Constraints Instantly prune illegal branches

Step 08: Calculate Edge Weights Accurately Sum costs/times along surviving candidate routes

Step 09: Benchmark & Select Best Route Pick minimum or maximum as demanded

Step 10: Sanity Check Against Stated Diagram Verify no arrow was reversed or unstated edge assumed

PROTOCOL DEMONSTRATION IN ACTION Pipeline Flow

The Chemical Transfer Pipeline

A chemical plant transfers solvent from Tank S to Tank T. The pipe segments with their flow transfer times (minutes) are: S → A (4 min), S → B (6 min), A → B (3 min), A → T (9 min), and B → T (5 min). All pipes are strictly one-way.

Candidate Route 1: S → A → T = 4 + 9 = 13 minutes.

Candidate Route 2: S → A → B → T = 4 + 3 + 5 = 12 minutes.

Candidate Route 3: S → B → T = 6 + 5 = 11 minutes.

Execution Result: Shortest transfer time is 11 minutes via S → B → T.

✓ Verified: 3 simple paths exist, and 11 minutes is the unique minimum.

SECTION I • 10 MASTER WORKED EXAMPLES

Solved Examples (Easy to Hard)

Ten complete, step-by-step solved network problems covering node degree, path counting, directed cycles, reachability, shortest weights, and multi-constraint optimization.

EXAMPLE 01 (EASY) • DIRECT CONNECTION IDENTIFICATION Transit Grid

The City Metro Interchange Network

Network Specification: A city metro network connects five central stations: A, B, C, D, and E. Direct single-track rail connections exist between the following pairs: (A, B), (A, C), (B, D), (C, D), and (C, E). All connections are two-way. No other tracks exist.

Question: Which of the following station pairs possesses a direct, single-track rail connection?

A) A and D

B) B and E

C) C and E ✓

D) A and E

Step-by-Step Reasoning: Check each option against the explicit edge list {A-B, A-C, B-D, C-D, C-E}.

• Option A: A and D have no direct edge. Reaching D from A requires transferring at B (A-B-D) or C (A-C-D) (2 hops).

• Option B: B and E have no direct edge. Travelling between B and E requires B-D-C-E or B-A-C-E (3 hops).

• Option C: Edge (C, E) is an explicit element of the stated edge list. Thus, C and E are directly connected!

• Option D: A and E have no direct edge; travel requires A-C-E (2 hops).

✓ Verification: Option C strictly matches the formal edge list. Verified!

EXAMPLE 02 (EASY) • NODE DEGREE CALCULATION Data Center

Server Rack Hub Connections

Network Specification: A high-performance computing cluster has six servers: S1, S2, S3, S4, S5, and S6. Physical ethernet cables are installed between the following pairs: (S1, S2), (S1, S3), (S1, S4), (S2, S3), (S3, S4), (S3, S5), (S4, S5), (S4, S6), and (S5, S6). All connections are bidirectional.

Question: What is the degree (total number of direct physical connections) of Server S3?

A) 2

B) 3

C) 4 ✓

D) 5

Step-by-Step Reasoning: The degree of a node in an undirected graph equals the number of distinct edges incident to it.

Let us list all edges containing node S3:

1. (S1, S3) → neighbor S1

2. (S2, S3) → neighbor S2

3. (S3, S4) → neighbor S4

4. (S3, S5) → neighbor S5

Server S3 is connected to exactly 4 servers: {S1, S2, S4, S5}. Server S6 does not connect to S3.

✓ Verification: Degree of S3 = 4. Verified!

EXAMPLE 03 (MEDIUM) • DIRECTED PATH TRACING Logistics

Supply Chain Courier Route

Network Specification: A parcel delivery company operates 5 sorting hubs: P, Q, R, S, and T. The one-way flight routes are: P → Q, P → R, Q → S, R → Q, R → T, and S → T.

Question: How many distinct simple directed paths exist to transport a parcel from Hub P to Hub T?

A) 1

B) 2

C) 3 ✓

D) 4

Step-by-Step Reasoning: We branch from P:

1. Branch via P → Q: From Q, the only outgoing edge is Q → S. From S, the only outgoing edge is S → T.
→ Path 1: P → Q → S → T (Length = 3 hops).

2. Branch via P → R: From R, we have two outgoing edges: R → T and R → Q.

Taking R → T directly completes the route:
→ Path 2: P → R → T (Length = 2 hops).
Taking R → Q leads to Q → S → T:
→ Path 3: P → R → Q → S → T (Length = 4 hops).

No other outgoing edges exist from P. All 3 paths are simple (no node repeated).

✓ Verification: Exactly 3 simple paths exist. Verified!

EXAMPLE 04 (MEDIUM) • REACHABILITY & DISCONNECTED COMPONENTS Power Grid

Regional Power Grid Sub-stations

Network Specification: A power authority monitors 7 substations: G1, G2, G3, G4, G5, G6, and G7. After a storm damages major feeder towers, the surviving active two-way transmission lines are: (G1, G2), (G2, G3), (G1, G3), (G3, G4), (G5, G6), and (G6, G7).

Question: Which of the following statements is mathematically TRUE regarding grid connectivity?

A) G1 can transmit electricity to G6 via G4

B) G4 and G5 belong to the same connected component

C) No path exists between G2 and G7 ✓

D) G5 is an isolated dead-end node with degree 0

Step-by-Step Reasoning: Determine the connected components of the graph:

• Component 1 contains nodes connected through G1-G2, G2-G3, G1-G3, G3-G4: {G1, G2, G3, G4}.

• Component 2 contains nodes connected through G5-G6, G6-G7: {G5, G6, G7}.

There is zero edge linking any node of Component 1 to Component 2. The components are mutually disjoint: {G1, G2, G3, G4} ∩ {G5, G6, G7} = ∅.

Since G2 is in Component 1 and G7 is in Component 2, no path of any length can connect G2 and G7. G5 has degree 1 (connected to G6), so Option D is false.

✓ Verification: Option C is mathematically true. Verified!

EXAMPLE 05 (MEDIUM) • PATH ENUMERATION Ethernet Flow

Office Ethernet Packet Transmission

Network Specification: A local office network transmits data packets across 5 routing switches: A, B, C, D, and E. The allowable one-way packet transmission channels are: A → B, A → C, B → C, B → D, C → D, C → E, and D → E.

Question: How many distinct simple directed paths exist to transmit a data packet from Switch A to Switch E?

A) 3

B) 4

C) 5 ✓

D) 6

Step-by-Step Reasoning: We trace systematically starting from A:

1. Routes beginning with A → B:

From B, go to C:
- From C, go direct to E: Path 1: A → B → C → E
- From C, go via D: Path 2: A → B → C → D → E
From B, go to D: Path 3: A → B → D → E

Subtotal via B = 3 paths.

2. Routes beginning with A → C:

From C, go direct to E: Path 4: A → C → E
From C, go via D: Path 5: A → C → D → E

Subtotal via C = 2 paths.

Total distinct paths = 3 + 2 = 5 distinct simple paths.

✓ Verification: Total simple paths = 5. Verified!

EXAMPLE 06 (MEDIUM) • TERMINAL SINK IDENTIFICATION Hydraulics

One-Way Canal Irrigation System

Network Specification: An agricultural gravity-fed irrigation canal network flows between 6 reservoirs: R1, R2, R3, R4, R5, and R6. The downward sloped channels are: R1 → R2, R1 → R3, R2 → R4, R3 → R4, R3 → R5, R4 → R5, R4 → R6, and R5 → R6.

Question: Which reservoir acts as a terminal sink (dead end from which water cannot flow outward to any other reservoir)?

A) R1

B) R3

C) R5

D) R6 ✓

Step-by-Step Reasoning: A terminal sink in a directed network is defined as a node with out-degree = 0 (no outgoing directed edges).

Let us evaluate the out-degree of every reservoir:

• R1: Outgoing edges to R2, R3 → out-degree = 2 (Source)

• R2: Outgoing edge to R4 → out-degree = 1

• R3: Outgoing edges to R4, R5 → out-degree = 2

• R4: Outgoing edges to R5, R6 → out-degree = 2

• R5: Outgoing edge to R6 → out-degree = 1

• R6: Incoming edges from R4 and R5, but zero outgoing edges → out-degree = 0.

R6 is the unique terminal sink. Water entering R6 has no exit channel.

✓ Verification: R6 out-degree is 0. Verified!

EXAMPLE 07 (MEDIUM) • DIRECTED REACHABILITY & ONE-WAY TRAPS Traffic Flow

Urban Traffic System with Mixed Street Directions

Network Specification: An urban traffic core consists of 5 road junctions: J1, J2, J3, J4, and J5. Due to municipal traffic regulations, the streets operate as follows: J1 → J2 (one-way), J1 → J4 (one-way), J4 → J3 (one-way), J3 → J5 (one-way), J5 → J2 (one-way), and J2 ↔ J3 (two-way street between J2 and J3).

Question: A delivery vehicle is currently stationed at Junction J4. Which junction CANNOT be reached by any legal route starting from J4?

A) J2

B) J3

C) J5

D) J1 ✓

Step-by-Step Reasoning: We perform a reachability trace starting from J4:

1. From J4, the only outgoing street is J4 → J3. Thus, J3 is reachable.

2. From J3, the vehicle can travel via:

Two-way street J3 → J2 → J2 is reachable.
One-way street J3 → J5 → J5 is reachable.

3. From J5, the vehicle can reach J2 via J5 → J2.

4. Can the vehicle ever reach J1? Look at the edges incident to J1: both J1 → J2 and J1 → J4 point AWAY from J1. There is no incoming edge into J1 (in-degree = 0).

Therefore, J1 is completely unreachable from J4 (and from any other junction in the network).

✓ Verification: J1 has in-degree 0; unreachable from J4. Verified!

EXAMPLE 08 (HARD) • MINIMUM-EDGE ROUTE (FEWEST HOPS) Aviation

Domestic Airline Hub Network

Network Specification: An airline serves 6 cities: Delhi (DEL), Mumbai (BOM), Jaipur (JAI), Ahmedabad (AMD), Kolkata (CCU), and Bengaluru (BLR). Direct two-way non-stop flights operate on the following routes: (DEL, JAI), (DEL, BOM), (DEL, CCU), (JAI, AMD), (AMD, BOM), (BOM, BLR), and (CCU, BLR).

Question: What is the minimum number of flights (edges) required for a passenger to travel from Jaipur (JAI) to Kolkata (CCU)?

A) 1 flight

B) 2 flights ✓

C) 3 flights

D) 4 flights

Step-by-Step Reasoning: We search for the shortest path in terms of hop count from JAI to CCU:

1. Can we travel in 1 flight? Check direct edge (JAI, CCU): Not in the flight list.

2. Can we travel in 2 flights? A 2-hop route requires an intermediate hub H connected to both JAI and CCU:

Neighbors of JAI: {DEL, AMD}.
Neighbors of CCU: {DEL, BLR}.
Intersection: {DEL, AMD} ∩ {DEL, BLR} = {DEL}.

Since DEL connects directly to JAI and directly to CCU, the route JAI — DEL — CCU takes exactly 2 flights.

Alternative routes like JAI — AMD — BOM — BLR — CCU require 4 flights. Minimum flights required = 2.

✓ Verification: Shortest path is JAI-DEL-CCU (2 edges). Verified!

EXAMPLE 09 (HARD) • WEIGHTED ROUTE OPTIMIZATION Logistics Tolls

Pipeline Network with Highway Toll Fees

Network Specification: A freight carrier transports heavy machinery from origin Terminal A to final destination Terminal E across 5 junctions: A, B, C, D, and E. The directed highway legs and their toll fees ($) are: A → B ($10), A → C ($3), B → E ($15), C → B ($2), C → D ($4), D → E ($5), and A → E ($30, direct expressway).

Question: What is the minimum total toll fee required to transport cargo from A to E, and how does its edge count compare to the direct expressway?

A) Cost $30 with 1 edge

B) Cost $25 with 2 edges

C) Cost $20 with 3 edges

D) Cost $12 with 3 edges ✓

Step-by-Step Reasoning: Enumerate every valid simple path from A to E and compute its total toll:

Route	Leg Tolls	Hops	Total Toll
1. A → E	30	1	$30
2. A → B → E	10 + 15	2	$25
3. A → C → B → E	3 + 2 + 15	3	$20
4. A → C → D → E	3 + 4 + 5	3	$12 ★

The minimum toll route is A → C → D → E with a total toll of $12.

Notice that the direct route has the fewest edges (1 edge) but is by far the most expensive ($30). The cheapest route uses 3 edges!

✓ Verification: Minimum weight is $12 (3 edges). Verified!

EXAMPLE 10 (HARD) • MULTI-CONSTRAINT ROUTE SATISFACTION Disaster Relief

Highway Logistics Under Flood & Customs Inspection

Network Specification: An emergency relief convoy departs from Base Station S destined for Field Hospital D. The highway network connects towns T1, T2, T3, and T4 with the following one-way travel times (hours): S → T1 (3h), S → T2 (2h), T1 → T3 (4h), T1 → T4 (6h), T2 → T3 (5h), T2 → T4 (3h), T3 → D (4h), and T4 → D (5h).

Written Operational Constraints:
1. A flash flood has completely destroyed the bridge between T1 and T4, making segment T1 → T4 impassable.
2. Under government disaster protocols, the convoy must pass through Town T3 to collect medical narcotics from the central dispensary.
3. The convoy must arrive at Hospital D in the minimum possible total travel time.

Question: Under these constraints, what is the minimum total travel time from S to D, and how many distinct routes achieve this minimum time?

A) 10 hours with 1 route

B) 11 hours with 2 routes ✓

C) 12 hours with 1 route

D) 15 hours with 3 routes

Step-by-Step Reasoning:

1. Apply Constraint 1: Discard road segment T1 → T4 entirely.

2. Apply Constraint 2: Every candidate route must include node T3. Any path moving directly from T2 or T1 to T4 without touching T3 is disqualified.

3. From T3, the only outgoing edge to destination is T3 → D (4h). Thus all valid routes must end with ... → T3 → D.

4. Let us trace all surviving paths reaching T3 from S:

Route A: S → T1 → T3 → D
Travel Time = 3 (S-T1) + 4 (T1-T3) + 4 (T3-D) = 11 hours.
Route B: S → T2 → T3 → D
Travel Time = 2 (S-T2) + 5 (T2-T3) + 4 (T3-D) = 11 hours.

5. Are there any other paths to T3? S only links to T1 and T2. T1 only reaches T3 (since T1-T4 is closed). T2 only links to T3 and T4 (and T4 does not link back to T3). Hence, exactly two valid routes exist, and both require exactly 11 hours!

✓ Verification: Exactly 2 valid routes achieve the minimum time of 11 hours. Verified!

SECTION J • EXAM PITFALLS

Common Mistakes in Network Diagrams

More than 40% of errors in network reasoning stem from perceptual oversights and hasty assumptions. Review these 11 fatal mistakes:

1. Confusing Nodes with Edges When asked for the number of connections, counting the number of cities instead of the number of transmission cables. Edges are pairs; nodes are individual points.

2. Missing Arrowheads on Directed Edges Moving backward along a one-way street because the line visually connected two points. In directed graphs, moving opposite to an arrowhead is an instant invalidation.

3. Treating an Indirect Path as a Direct Link Answering that A and C are connected when only A-B and B-C exist. Always verify if a single unbroken edge links the two vertices.

4. Double-Counting an Undirected Edge In an undirected graph, edge (A, B) and edge (B, A) are the SAME single physical connection. Do not count it twice when totaling connections.

5. Assuming Line Crossings Create a Junction If two flight paths cross on a map, planes do not switch routes mid-air! Unless a labelled junction circle is explicitly printed, crossing lines do not form a node.

6. Choosing Fewest Hops Instead of Minimum Cost Answering a 1-hop path with cost $50 when a 2-hop path with cost $15 + $15 = $30 exists. Check the exact objective demanded by the prompt.

7. Allowing Cyclic Node Repetition in Simple Paths Counting paths like A → B → C → B → D when the question asks for simple paths. A simple path permits no repeated vertices.

8. Overlooking Disconnected Clusters Tracing a path between two nodes that actually belong to separate, disjoint network components.

9. Forgetting Written Negative Constraints Successfully optimizing a route but forgetting the question stated "Town X is banned due to curfew."

10. Guessing Unlabelled Edge Weights If an edge has no number attached, never assume its weight is 0 or equal to an adjacent edge unless explicitly specified.

SECTION K • SPEED & ACCURACY TACTICS

Shortcuts & Exam Strategy

1. The Scratchpad Edge-List Method

When a diagram has crossed lines or cluttered arrows, spend 20 seconds writing down the adjacency list on your rough sheet:

A → B, C
B → D, E
C → D
D → E

Tracing from an edge list eliminates 100% of visual line-crossing optical illusions!

2. Backward Pruning for Bottlenecks

If the destination T only has a single incoming edge (e.g., K → T), then every single valid route must end with K → T.

You can immediately discard any path that cannot reach node K, shrinking your search space by 50% instantly.

3. Option Bound Elimination

In multiple choice questions asking for path counts (e.g. Options: 2, 3, 5, 8), once you discover 4 distinct valid routes, you can instantly eliminate Options A and B!

4. Pacing Allocation Rule

90 seconds per standalone CET/SNAP question: 20 seconds reading setup → 30 seconds tracing → 30 seconds calculating weights → 10 seconds verification.

SECTION L • 15 VERIFIED EXAM DRILLS

Practice Questions with Interactive Solutions

Test your mastery across 15 original questions spanning easy, medium, and hard difficulty. Click "Reveal Strategic Breakdown" to inspect the step-by-step mathematical working.

PRACTICE 01 (EASY) • AIRPORT HUB DEGREE Aviation

Drill 01: Direct Flight Links in a Regional Network

Setup: Six regional airports — A, B, C, D, E, and F — are connected by bidirectional flight corridors. The operating corridors are: (A, B), (B, C), (C, D), (D, E), (E, F), (F, A), and an express diagonal flight corridor (B, E).

Question: Which of the following airports has direct non-stop flight connections to exactly 3 other airports?

A) Airport A

B) Airport B ✓

C) Airport C

D) Airport D

PRACTICE 02 (EASY) • DIRECTED IN-DEGREE Social Network

Drill 02: Follower Count in a Social Graph

Setup: Five users — U1, U2, U3, U4, and U5 — form a directed social media graph. An edge X → Y indicates that user X follows user Y. The active follow relations are: U1 → U2, U1 → U3, U2 → U3, U2 → U4, U3 → U4, U4 → U3, U4 → U5, U5 → U1, and U5 → U3.

Question: What is the in-degree (number of followers) of User U3?

A) 1

B) 2

C) 3

D) 4 ✓

PRACTICE 03 (EASY) • DISCONNECTED COMPONENTS LAN Topology

Drill 03: Counting Isolated Sub-Networks

Setup: An office floor contains 8 computers labelled C1 through C8. Network cables connect the following pairs: (C1, C2), (C2, C3), (C3, C1), (C4, C5), (C5, C6), (C6, C4), and (C7, C8). All cables allow two-way communication.

Question: How many completely independent, disconnected sub-networks (connected components) exist on this floor?

A) 1

B) 2

C) 3 ✓

D) 4

PRACTICE 04 (EASY) • BOUNDARY TERMINALS Workflow

Drill 04: Project Workflow Start and Completion Tasks

Setup: A software development workflow consists of 6 sequential tasks: T1, T2, T3, T4, T5, and T6. The dependency arrows (A → B means Task A must complete before Task B begins) are: T1 → T2, T1 → T3, T2 → T4, T3 → T4, T3 → T5, T4 → T6, and T5 → T6.

Question: How many initial start tasks (in-degree = 0) and how many terminal completion tasks (out-degree = 0) exist in this project pipeline?

A) 1 start task, 1 terminal task ✓

B) 2 start tasks, 1 terminal task

C) 1 start task, 2 terminal tasks

D) 2 start tasks, 2 terminal tasks

PRACTICE 05 (MEDIUM) • PATH COUNTING Directed Graph

Drill 05: Data Pipeline Route Enumeration

Setup: A directed analytics pipeline connects five processing stages: X, Y, Z, W, and V. The valid data transfer stages are: X → Y, X → Z, Y → W, Z → Y, Z → W, and W → V.

Question: How many distinct simple directed paths exist to route data from Stage X to Stage V?

A) 2

B) 3 ✓

C) 4

D) 5

PRACTICE 06 (MEDIUM) • FEWEST-HOPS SHORTEST PATH Mesh Grid

Drill 06: Express Highway Bypass in an Undirected Grid

Setup: Seven towns labelled V1 through V7 are connected by two-way roads: (V1, V2), (V1, V3), (V2, V4), (V3, V4), (V3, V5), (V4, V6), (V5, V6), (V6, V7), and an express direct link (V2, V6) that bypasses town V4.

Question: What is the minimum number of road segments (edges) required to travel from Town V1 to Town V7?

A) 2

B) 3 ✓

C) 4

D) 5

PRACTICE 07 (MEDIUM) • DIRECTED CYCLE DETECTION Conveyor Loop

Drill 07: Factory Assembly Line Endless Loop

Setup: An automated manufacturing conveyor belt moves parts between 5 workstations: K1, K2, K3, K4, and K5. The directional belts are: K1 → K2, K2 → K3, K3 → K4, K4 → K2, and K4 → K5.

Question: Which set of workstations forms a closed directed cycle (loop) allowing infinite continuous recirculation of parts?

A) K1, K2, K3

B) K2, K3, K4 ✓

C) K3, K4, K5

D) K1, K4, K5

PRACTICE 08 (MEDIUM) • WEIGHTED SHORTEST DISTANCE Navigation

Drill 08: Shortest Travel Distance in a City Grid

Setup: A courier navigates from Start Station S to Goal Depot G across intermediate waypoints A, B, and C. The directed road distances (km) are: S → A (4 km), S → B (7 km), A → B (2 km), A → C (6 km), B → C (3 km), B → G (8 km), and C → G (2 km).

Question: What is the shortest total travel distance (in km) from S to G?

A) 11 km ✓

B) 12 km

C) 14 km

D) 15 km

PRACTICE 09 (MEDIUM) • EDGE COUNT VS TOTAL WEIGHT Cost vs Hops

Drill 09: Freight Route Trade-Off Analysis

Setup: Three candidate routes link Factory Alpha (A) to Port Omega (Z):
• Route 1: A → M → Z (2 edges). Leg weights: A-M = $14, M-Z = $16.
• Route 2: A → N → P → Z (3 edges). Leg weights: A-N = $6, N-P = $7, P-Z = $8.
• Route 3: A → Q → R → S → Z (4 edges). Leg weights: A-Q = $4, Q-R = $4, R-S = $5, S-Z = $5.

Question: Which route has the lowest total cost, and which route has the fewest edges?

A) Route 1 has lowest cost; Route 3 has fewest edges

B) Route 2 has both lowest cost and fewest edges

C) Route 3 has lowest cost; Route 1 has fewest edges ✓

D) Route 3 has both lowest cost and fewest edges

PRACTICE 10 (MEDIUM) • PROHIBITED NODE ELIMINATION Quarantine Routing

Drill 10: Road Network with a Quarantined Town

Setup: A directed delivery grid connects Origin S to Destination D via five towns: T1, T2, T3, T4, and T5. The allowable one-way roads are: S → T1, S → T2, T1 → T3, T1 → T4, T2 → T4, T2 → T5, T3 → D, T4 → D, and T5 → D.

Constraint: Town T4 is under strict epidemic quarantine; no delivery vehicle may pass through or enter Town T4.

Question: How many valid routes from S to D remain available after excluding Town T4?

A) 1

B) 2 ✓

C) 3

D) 4

PRACTICE 11 (HARD) • BOTTLENECK THROUGHPUT CAPACITY Pipeline Hydraulics

Drill 11: Water Supply Network Bottleneck Capacity

Setup: An industrial water supply grid transfers water from Reservoir S to Factory E through booster stations A, B, C, and D. The directed pipeline flow capacities (in kilolitres/hour) are: S → A (50 kL/h), S → B (40 kL/h), A → C (35 kL/h), B → C (25 kL/h), B → D (20 kL/h), C → E (30 kL/h), and D → E (20 kL/h).

Question: Consider the single pipeline route S → A → C → E. What is the bottleneck capacity (maximum flow that can pass through this specific path)?

A) 50 kL/h

B) 35 kL/h

C) 30 kL/h ✓

D) 20 kL/h

PRACTICE 12 (HARD) • MULTI-OBJECTIVE BATTERY & TIME Drone Routing

Drill 12: Delivery Drone Battery & Flight Time Optimization

Setup: An autonomous delivery drone flies from Warehouse W to Hospital H via relay towers R1, R2, R3, and R4. Flight legs have specified [Battery Consumption %, Flight Time min]: W → R1 [20%, 8 min], W → R2 [25%, 10 min], R1 → R3 [25%, 12 min], R1 → R4 [35%, 15 min], R2 → R3 [15%, 7 min], R2 → R4 [30%, 14 min], R3 → H [30%, 11 min], and R4 → H [20%, 9 min].

Constraints: Total battery consumption must NOT exceed 75%. The flight must reach Hospital H in the minimum possible total time.

Question: What is the optimal route flight time, and what is its total battery consumption?

A) 28 minutes with 70% battery ✓

B) 31 minutes with 75% battery

C) 32 minutes with 75% battery

D) 33 minutes with 75% battery

CORRECT ANSWER: OPTION A

Strategic Working: Evaluate all four possible paths from W to H:

Path	Battery %	≤ 75%?	Time
1. W → R2 → R3 → H	25 + 15 + 30 = 70%	Valid	10 + 7 + 11 = 28 min ★
2. W → R1 → R3 → H	20 + 25 + 30 = 75%	Valid	8 + 12 + 11 = 31 min
3. W → R1 → R4 → H	20 + 35 + 20 = 75%	Valid	8 + 15 + 9 = 32 min
4. W → R2 → R4 → H	25 + 30 + 20 = 75%	Valid	10 + 14 + 9 = 33 min

The fastest valid route is W → R2 → R3 → H, taking exactly 28 minutes and consuming 70% battery.

✓ Verification: 28 min with 70% battery. Verified!

PRACTICE 13 (HARD) • SPANNING TREE CONNECTIVITY Network Design

Drill 13: Minimum Cable Installation for Full Connectivity

Setup: A telecommunications company is tasked with linking 9 remote polar research stations. Currently, zero communication cables exist between them.

Question: What is the absolute minimum number of two-way communication cables that must be laid to ensure that every station can communicate with every other station (either directly or via intermediate stations), and what graph structure does this minimal network form?

A) 7 links, forming a cycle

B) 8 links, forming a spanning tree ✓

C) 9 links, forming a closed ring

D) 12 links, forming a bipartite mesh

PRACTICE 14 (HARD) • REACHABILITY WITH FAILED NODE Distributed Systems

Drill 14: Microservice RPC Calls After a Server Crash

Setup: Six cloud microservices — M1, M2, M3, M4, M5, and M6 — communicate via asynchronous RPC calls. The directed call dependencies are: M1 → M2, M2 → M3, M3 → M4, M4 → M5, M5 → M2, and M6 → M1.

Crisis: Service M3 experiences a fatal crash and goes completely offline, incapable of receiving or forwarding any calls.

Question: After M3 crashes, which active service(s) can still successfully transmit an RPC call to Service M5?

A) Services M1, M2, and M6

B) Service M4 only ✓

C) Services M2 and M4

D) No service can reach M5

PRACTICE 15 (HARD) • CRITICAL PATH METHOD (CPM) Project Management

Drill 15: Critical Path Duration in a Software Release

Setup: A product release pipeline consists of dependent development activities from Start to Launch. Activity durations (days) are: Start → Alpha (4 days), Start → Beta (6 days), Alpha → Gamma (5 days), Beta → Gamma (5 days), Beta → Delta (7 days), Gamma → Launch (3 days), and Delta → Launch (3 days).

Question: What is the Critical Path (the longest path of dependent activities determining the minimum total project duration)?

A) Path Start → Alpha → Gamma → Launch (12 days)

B) Path Start → Beta → Gamma → Launch (14 days)

C) Path Start → Beta → Delta → Launch (16 days) ✓

D) Path Start → Alpha → Delta → Launch (14 days)

SECTION M • FREQUENTLY ASKED QUESTIONS

Frequently Asked Questions

Q1: What is a network diagram?

A network diagram is a structural visual representation consisting of entities (nodes or vertices) linked by lines or arrows (edges or arcs) representing relationships, transport links, communication cables, or workflow sequences.

Q2: What is the difference between a node and an edge?

A node represents a stationary entity (e.g. city, server, workstation, person). An edge represents the relationship or pathway linking two nodes (e.g. highway, flight route, cable, pipeline).

Q3: What is the difference between a direct connection and a path?

A direct connection is a single edge between two adjacent nodes without intermediate stops. A path is a composite sequence of one or more edges that begins at an origin and traverses intermediate nodes to reach a destination.

Q4: How do I identify a directed network?

Look for arrowheads on the edges. If edges have arrows (A → B), movement is legal only in the direction of the arrow. If edges are simple line segments without arrows, movement is bidirectional.

Q5: How do I count paths without double-counting?

Use systematic branching: list paths by their first outgoing edge, keep a written log of visited vertices to avoid cycles, and proceed node by node. For layered graphs, use stage multiplication or topological node addition.

Q6: Is the shortest path always the cheapest path?

No! The path with the fewest edges (hops) often carries a higher weight than a multi-hop path with low individual tolls. Always calculate total weights along every candidate route.

Q7: What is a disconnected network?

A disconnected network is divided into two or more isolated clusters where no path exists between vertices belonging to different clusters. Nodes in different components have zero mutual reachability.

Q8: How do I solve network questions quickly in an exam?

Translate ambiguous visual crossings into a clean rough edge list, mark one-way arrows boldly, eliminate branches that hit prohibited nodes early, and summarize candidate weights in a quick 3-column table on your scratchpad.

RELATED REASONING MODULES:

Logical Puzzles Arrangements Directions Decision Making

PREVIOUS TOPIC (TOPIC 16)

← Decision Making

📋

CURRICULUM DIRECTORY

LR Vault Index

📚

NEXT TOPIC (TOPIC 18)

Cause & Effect / Assertion →

💡

🚀 Topic 18: Cause & Effect / Assertion (Coming Next) Verbal & Critical

Advance next to Cause & Effect / Assertion — master the evaluation of direct causes, independent contributing factors, common root causes, and assertion-reason validity for MBA CET, SNAP, and CAT.