Classic Network-related computing problem
Here is a challenge that rewards the best answer with $10,000 and their code in Borland's developer magazine each year. It's not easy!
Networks are complex. Transporting data from point A to point B in the shortest time and traveling the smallest distance.
Here, we have two variables - Speed (S) and Distance (D). Now, the general rule one might think is that as D increases S decreases. That is incorrect, an so is the inverse.
A Link (L) can have a different D and S then another L connected to it, and there may be many L connected to each other.
A Route (R) is any path between point A and point B. It can have 1 or more L.
======================================================================
Best Route (B) = (first D+S)+(last D+S)^(Avg. D + Avg. S)/(Number of Links Traveled)
======================================================================
Therefore, the Best Route has the lowest number of links and the highest average speed.
Good luck, and may the network be with you.
