ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1544. Classmates 3

Proof of bfs-with-min-depth solution
Posted by Joseph Puh the Battle Bear 8 Aug 2011 12:09
We can iterate through vertexes and choose one with smallest bfs-depth... How i can proove that it is correct?

Edited by author 08.08.2011 12:09