The algorithms exam really had me thinking for some time. Although I lost most
marks to carelessness, I really did not have an idea to solve this problem "
Give an O (V+E) algorithm to find shortest paths from a single source for
a directed weighted graph with edge weights only 1 and 2." As it ironically
turns out, this brainteaser has a sarcastically easy solution. If you pester me
enough I shall reveal it to you 🙂
This weekend is a busy one, with work required on the project and on a proposal
for research studies.