Well, we have a project in class now. It is relatively simple. Find the shortest k-disjoint paths in a graph. Well, I got bored a bit on Sunday and didn’t feel like research, so I started coding. I wrote the graph, node, and edge data structures along with all its basics functions. I even went as far as to implement Dijsktra’s algorithm. I had to force myself to stop because I didn’t want to finish the thing before my partner and I met for the first time (tomorrow).
Otherwise, school has been going fine. Been busy reading papers. It never ends.