P1-A
EasyClosed
Signal Relay
A campus network is modelled as an undirected graph of relay nodes. Given the adjacency list and a source node, report the minimum number of hops needed to reach every other node, or -1 where no route exists.
Submission
Single source file. Standard input to standard output.
- Released
- Released 16 Aug 2026, 10:00
- Deadline
- Due 16 Aug 2026, 14:00
No attachment — full statement above.