I have tried to learn hopcroft-karp algorithm for last couple of days.I went through many articles, wiki page but I am not able to understand the use of bfs. Basically my ques is

Why do the augmenting paths have to be the shortest?

and can you explain why the total number of iterations is O(√|V|).