Find a Route in a Paper Network

5 questions0m 0s

Learn the skill

Every drawn link works in both directions. One hop crosses one link. Fewer hops do not automatically mean a faster route: speed depends on properties not shown here. Work only with the fictional model, not a real network.

Worked example

For links A-B and B-D, route A-B-D uses two hops. Without link A-D, a one-hop shortcut is not available.

Two-way links join A to B and C, and join B and C to D. No direct A-D link is drawn. — Connectivity and hop count alone do not determine speed.

The Four-Node Network

Available two-way links are A-B, B-D, A-C and C-D. Initially, A-B-D and A-C-D are valid two-hop routes from A to D. If B-D is unavailable, A-C-D still works. The diagram gives no bandwidth, delay, traffic or security measurements.

Question 1 How many links does A-B-D use? Answer

Question 2 After B-D fails, which route still works? A-B-D A-C-D A-D

Question 3 Is there a drawn direct link A-D? Yes Only if A is blue No

Question 4 Do equal hop counts prove equal travel times? No; link and traffic details are missing Yes; two hops always take two seconds Yes; all links are identical

Question 5 If B-D and C-D are both unavailable, how many routes from A reach D? Answer