You open the DILR section, scan the first set and see a web of cities, arrows and numbers. Your heart sinks. Many aspirants skip these sets in panic, yet this is often where the section can be won. CAT 2026 DILR network and route-based logical reasoning sets look intimidating, but they follow a small number of repeatable patterns. Once you learn to model the network correctly, the questions tend to answer themselves.
This guide shows you how to read, draw and solve network-based DILR sets, with a fully worked example, common traps, a practice plan and FAQs. Use it as your reference while preparing for CAT 2026.
What Are Network and Route-Based Logical Reasoning Sets in CAT DILR?
A network or route-based set describes a system of nodes (cities, stations, offices, servers) joined by edges (roads, flights, cables, pipelines). The questions then ask you to count routes, find shortest or cheapest paths, maximise flow, or deduce a missing connection.
These sets are a core part of the CAT LRDI family. They belong to the wider group of path, connectivity and graph-based reasoning problems, a topic that has appeared regularly in recent papers. The framing changes each year (airlines, delivery hubs, metro lines, data packets), but the underlying logic barely moves.
In the exam, they usually appear as:
- Pure route sets: a map or table of connections, with questions on possible paths.
- Flow or capacity sets: edges carry a limited number of units, and you find the maximum or minimum flow.
- Cost and time sets: edges carry distances, fares or hours, and you optimise a journey.
- Hybrid sets: a network combined with conditions such as “no city is visited twice” or “exactly one route is closed.”
Why You Should Not Skip Network Sets in CAT 2026
Aspirants often avoid these sets because they look visual and messy. That is a mistake, for three reasons.
- The difficulty is representational, not conceptual. Once the diagram is drawn correctly, the reasoning is usually short.
- They rely on basic arithmetic. You rarely need advanced Quant, just clean addition, comparison and careful counting.
- Few people attempt them well. A candidate who handles one network set accurately gains an edge over those who skip it.
Do not treat DILR as a “solve everything” section. Set selection matters as much as solving. A network set with clearly labelled edges and a handful of rules is often a better pick than a dense arrangement set with hidden conditions.
Types of Network and Route-Based Sets at a Glance
Identify the type within the first minute. It tells you which tool to use.
| Set type | Typical data given | Typical questions | Best tool |
|---|---|---|---|
| Route counting | Direct links between nodes | How many routes from A to E? | Systematic path listing / tree |
| Shortest / cheapest path | Distance, time or cost on edges | Minimum cost from P to T? | Node-by-node labelling |
| Flow and capacity | Units per edge (buses, packets, trucks) | Maximum flow? Effect of closing a link? | Cut method, flow balancing |
| Connectivity / deduction | Partial links plus rules | Which link must exist? | Matrix with Yes/No/Maybe |
| Hybrid conditions | Network plus constraints | How many valid itineraries? | Draw, then eliminate |
Step-by-Step Method to Solve Network-Based DILR Sets
Use this routine for every set. Practising it until it becomes automatic is the best preparation you can do.
Step 1: Read the Entire Set Before Drawing Anything
Spend 60 to 90 seconds on a full read of the set. Note whether edges are directed (one-way) or undirected, and whether the numbers represent distance, cost, frequency or capacity. A single missed word such as “one-way” or “at most” can derail every answer.
Step 2: Redraw the Network Cleanly
Convert the text into nodes and edges on your rough sheet. Place the source on the left and the destination on the right, so paths flow in one direction. Label each edge with its value. This clean drawing is the most valuable thing you will produce in the set.
Step 3: Build a Table of Edges
If the set has more than six or seven connections, list them as From, To, Value. A table avoids the confusion that comes from long text descriptions and speeds up later look-ups.
Step 4: Mark Constraints and Special Cases
Note every restriction: closed routes, mandatory stops, maximum number of hops, and any “exactly” or “at least” conditions. Mark them on the diagram in a different colour or with a symbol.
Step 5: Solve the Easy Questions First
Most sets contain one or two questions answered directly from the diagram. Take these marks first, then use the confidence and the filled-in information to attack the harder ones.
Step 6: Use the Right Technique for the Question
- Counting routes: Work from the destination backward, or list paths in a systematic order (for example, always expand the top branch first).
- Shortest path: Label each node with the best-known cost from the source and update as you move forward.
- Maximum flow: Compare the total capacity leaving the source with the total capacity entering the destination. The smaller number is the upper limit, and the true answer is limited by the narrowest “cut.”
- What-if questions: Redraw the network with the closed edge removed instead of editing the old one mentally.
Step 7: Cross-Check Before Moving On
Verify that your answer respects direction, capacity and constraints. Two seconds of checking prevents most careless errors.
Solved Example: A Route and Flow Set
Let’s apply the method to a typical CAT-style network problem.
Set: Five cities P, Q, R, S and T are connected by one-way bus routes. The number on each route shows the maximum buses that can run per day.
| From | To | Maximum buses per day |
|---|---|---|
| P | Q | 4 |
| P | R | 6 |
| Q | S | 3 |
| Q | R | 2 |
| R | S | 5 |
| R | T | 4 |
| S | T | 7 |
Q1. How many distinct routes exist from P to T?
List the paths systematically, expanding from P:
- P → Q → S → T
- P → Q → R → S → T
- P → Q → R → T
- P → R → S → T
- P → R → T
Answer: 5 routes.
Q2. How many of these routes pass through R?
Routes 2, 3, 4 and 5 include R. Only route 1 avoids it. Answer: 4 routes.
Q3. What is the maximum number of buses per day that can travel from P to T?
- Capacity leaving P: 4 + 6 = 10
- Capacity entering T: 4 (from R) + 7 (from S) = 11
The upper limit is 10, set by P. Now check that 10 is actually achievable:
- P sends 4 to Q and 6 to R.
- Q sends 3 to S and 1 to R (within its 2-bus limit).
- R now receives 6 + 1 = 7. It sends 4 to T and 3 to S (within its 5-bus limit).
- S receives 3 + 3 = 6 and sends all 6 to T (within its 7-bus limit).
- T receives 4 + 6 = 10.
Answer: 10 buses per day.
Q4. If R is closed, what is the new maximum flow from P to T?
Remove R and redraw. The only remaining path is P → Q → S → T. The narrowest link is Q → S at 3. Answer: 3 buses per day.
Notice how the clean drawing and edge table made every question quick. That is the pattern to build into your routine.
Tips to Improve Speed and Accuracy
Technique wins these sets, not raw intelligence. These habits help most:
- Work with a pencil-and-paper routine. Use the same layout for every network so your eyes know where to look.
- Use abbreviations. Single letters for nodes and short symbols for conditions save seconds that add up.
- Think in cuts. For flow questions, ask “where is the bottleneck?” before calculating anything.
- Count backward. To count routes to a destination, record the number of ways to reach each node from the source and add as you go. This prevents missed or duplicated paths.
- Spot symmetry. If two branches have identical values, you can solve one and mirror the result.
- Set a time cap. If a set has consumed more than about 8 to 10 minutes with little progress, leave it and return only if time permits.
Common Mistakes in Network and Route-Based Sets
| Mistake | Why it happens | How to fix it |
|---|---|---|
| Ignoring direction of edges | Treating one-way links as two-way | Draw arrowheads on every edge immediately |
| Missing paths while counting | Listing routes randomly | Expand branches in a fixed order |
| Confusing capacity with actual flow | Assuming every edge is full | Check inflow equals outflow at each node |
| Editing the old diagram for “what-if” questions | Mental updates introduce errors | Redraw a fresh network with the change |
| Overlooking constraints | Reading the conditions only once | Re-read all conditions before the final answer |
| Spending too long on a hard set | Sunk-cost thinking | Set a strict time limit and move on |
How to Choose the Right Set in the Exam
Set selection is a skill that separates high scorers from the rest. Before committing to a network set, run a quick two-minute check:
- Are the connections and values clearly listed, or buried in long paragraphs?
- Are the rules short and unambiguous?
- Do the first one or two questions look answerable from the diagram alone?
- Does it avoid layers of “if this, then that” conditions that depend on each other?
If most answers are yes, the set is a good bet. Network sets with a clear table of edges are generally safer than those described entirely in prose.
30-Day Practice Plan for Network and Route-Based DILR
Consistency beats intensity. Here is a simple plan to build mastery over a month.
| Week | Focus | Daily task | Goal |
|---|---|---|---|
| Week 1 | Basics of graphs and drawing | 1 easy network set, with a focus on clean diagrams | Build the drawing habit |
| Week 2 | Route counting and shortest path | 2 sets, timed at 15 minutes each | Improve accuracy and speed |
| Week 3 | Flow, capacity and what-if questions | 2 mixed sets plus review of errors | Learn to find bottlenecks |
| Week 4 | Mock-test simulation | 1 full DILR sectional every alternate day | Practise set selection under pressure |
After each set, spend five minutes on a short review. Note where you lost time, which technique worked best and what you would do differently. This reflection speeds up improvement far more than extra volume does.
How Network Sets Fit into Your Overall CAT 2026 DILR Strategy
Network sets are one piece of the section. A balanced plan also covers arrangements, tournaments, Venn diagrams and caselets. Aim to be comfortable with every common set type so you always have several good options on exam day.
A practical approach in the exam is to scan all the sets in the first few minutes, rank them by clarity and your confidence, and begin with the easiest. Network sets often land in the “easy to medium” bucket for well-prepared candidates, so make sure you know when to pick them.
For official updates on the exam pattern, always refer to the official CAT website. To strengthen your fundamentals, read about graph theory basics, which underpins nearly every network question.
Summary
- Network and route-based sets are about nodes and edges, and the difficulty is mostly in drawing the diagram correctly.
- Identify the set type first: route counting, shortest path, flow, connectivity or hybrid.
- Follow the seven-step routine: read, draw, tabulate, mark constraints, take easy marks, apply the right technique and cross-check.
- Use the cut method for flow questions and fixed-order listing for route counting.
- Always redraw the network for “what-if” questions.
- Practise 1-2 sets daily for 30 days, then move to timed sectionals.
- Choose sets wisely, and skip any set that eats time without progress.
Frequently Asked Questions (FAQs)
1. What are network and route-based sets in CAT DILR?
They are logical reasoning sets that describe points (nodes) connected by links (edges) such as roads, flights or cables. Questions ask you to count routes, find optimal paths, determine maximum flow or deduce missing connections.
2. Are network-based sets important for CAT 2026?
Yes. They have been a recurring set type in recent CAT LRDI papers, and the underlying logic repeats even when the story changes. Practising them gives you another reliable set type to choose from on exam day.
3. How do I draw a network quickly in the exam?
Place the source on the left and the destination on the right, mark every edge with its value and direction, and use single-letter labels for nodes. If there are many links, create an edge table first.
4. How long should I spend on a network set?
Aim for 8 to 10 minutes of solving after a one-minute read. If you are stuck after that point, move on and return only if time remains.
5. How do I find maximum flow in a network without advanced math?
Compare the total capacity leaving the source with the total entering the destination. Then look for the narrowest cut in between. The smallest of these values is the maximum flow. Confirm it by checking that inflow equals outflow at each node.
6. Should I skip network sets if I find them difficult?
Not automatically. Judge each set on clarity, not on topic. A well-structured network set with a clear table of edges is often easier than a text-heavy arrangement set.
Conclusion
Network and route-based sets reward structure, not speed. Draw the network cleanly, identify the set type, apply the matching technique and verify before moving on. The solved example above shows how a tidy diagram and edge table can turn a frightening set into four straightforward answers.
Practise with intent. Begin with simple networks, build up to flow and what-if questions, and finish with timed sectionals so set selection becomes second nature. With 30 focused days, CAT 2026 DILR network and route-based logical reasoning sets can become one of your most dependable scoring areas. Start with one set today, and let that routine carry you through the exam.
You May Also Like : CAT MOCK, CAT MOCK PYQ
Follow Us On : Facebook, Instagram, Youtube
