I am currently working on a project to pictorially explain the Hopcroft-Karp algorithm.
I am using the pseudo-code from the Wikipedia article.
I have also seen this algorithm implemented on Stack Overflow in Python
This would do fantastically if only I didn't have to understand the algorithm completely to use it.
My questions are as follows: What is the meaning of the Dist[] array in the pseudo-code, and how is the layering of the graph done in the Breadth-First-Search. I have a grasp on the workings of the DFS.
Thanks in advance.