It’s the least anticipated lecture ever. Well, sort of. Explaining the algorithm for finding maximum matching in a bipartite graph is fairly complicated. I tried my best to simplify the explanation, but it’s still pretty horrible. I didn’t have enough time to finish everything anyway. So, will try again next time.

It’s the first time that Nick missed the class. Laurier projects are crazy, it seems. Still find it amusing that the majority of the students that come to my office hour (of which there are very few) are not in my section.

A bit frustrated at the process of making final exams. I sent out something on Monday, no response. Sent out another batch of questions today, so far nothing. Maybe we won’t have a final exam.