Recently I have faced the following graph problem: Given a directed graph with nonnegative weights. There is a need to find a number of paths between two nodes which path's weights are less then specified number. Graph may contain cycles and path may contain cycles.
I have found the Yen's algorithm which can find K shortest paths and which may be adjusted to partially solve my problem (the algorithm finds loopless paths) and wondering now if there is an approach to solve the problem.
I have seen a lot of people saying that they are really happy about the website.
I think that it would be a very nice idea to let people make a material contribution to the website.
So that if somebody who loves this site or took high place in the contest can express his/her feeling by making a donation.