Finding the minimum path in a graph is a problem that occurs frequently in different situations. A well known algorithm for solving this problem is Dijkstra's algorithm.
To get an understanding of this algorithm, I tried watching a couple of lectures and reading some descriptions on a number of sites. The most detailed and easy-to-understand material I found was a sample question, explained thoroughly at Dijkstra's Algorithm example . Before stumbling across it, I did have some idea about this algorithm, but it did not have much to do with the real thing. (Update: this link doesn't seem to be working any longer.Pity)
I was introduced to Wodehouse by a friend while in school and I have been an avid fan since. The Jeeves books are the best of all, but I have not been able to find all of them in the local bookshops I usualy haunt.
Incidentlly, I was also introduced to Agatha Christie by the same friend. Now there are a number of her books that I have seen in every bookshop in Saddar, my usual resource, and none besides. When I had finished all the available ones, I searched for others and recognized the pattern. There are some including Black Coffee, 4:50 from Paddington, Nemesis that one can find in every shop.
Talking of books that one can find in every bookshop, there is sometimes a book-of-the-time that every shop offers you. Some time ago, it used to be the twilight series. The last time I went, there were A Song of Ice and Fire books in the most noticeable places. There was some other vampire series too, vampire diaries I guess, that had glossy black covers.The covers were nice.