Editorial for Mock CCC '18 Contest 5 J5/S3 - Directed Graph Connectivity


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Because the graph is small, it suffices to just do a BFS/DFS M times, one with each edge removed.


Comments

There are no comments at the moment.