List of top Data Interpretation & Logical Reasoning (DILR) Questions on Routes and Networks

A delivery driver must travel from Source (S) to Destination (D).
Possible paths:
S → A → C → D,
S → B → C → D,
S → A → E → D,
S → B → F → D.
Rules:
1. A route cannot repeat a node.
2. A route cannot have more than 3 edges.
3. C cannot be visited if E is visited.
4. B cannot be used if F is used.
How many valid routes exist from S to D?

A courier must travel from Hub S to Hub T using intermediate hubs A, B, C.
Allowed edges: S→A, S→B, A→C, B→C, C→T, A→T.
The courier cannot use more than 3 edges in total.
How many valid routes from S to T are possible?

A delivery network allows routes from Start (S) to End (E) through intermediate hubs A, B, C.
Allowed edges:
S→A, S→B, A→C, A→E, B→C, C→E.
A route cannot visit more than 3 nodes including S and E.
How many valid routes from S to E are possible?