# Maximum Matching in a bipartite graph

Can somebody clearly explain me the below problem of finding maximum matching in a bipartite graph?

How the vertices are entered in queue? How they choose augment? Are they choosing augment arbitrarily? What does that upward arrow mark below the queue elements represents?

Example Problem