No wonder I spend so much time on this forum

I have the following options:

1) Trawl through code (written by somebody else) that generates a complicated report, trying to figure out why a certain number is incorrect by a factor of 4000
2) Read every single post on this forum

Which would you choose?

Poll! ;)

Geek

I have a similar dilemma:

1) calculate times taken to travel between various points by ferry in an imaginary city in a far away country
2) read every single post on this forum

Geek

Fuckin' aye. I say it loud and I say it proud.

I could individually update lead times on a poorly configures SAP system and then process the resulting stock requirement exceptions.

cg5154 - does CTRL+F x4000 help you out any?

I have a similar dilemma:

1) calculate times taken to travel between various points by ferry in an imaginary city in a far away country
2) read every single post on this forum

As a geek, I feel obligated to suggest that you write a program that creates a weighted graph and applies Dijkstra's shortest path algorithm. It'll take more time than doing the calculations manually, but so much more fun.

I hate going through other peoples code! Most haven't got a clue and I get very frustrated. I tend to rewrite whole chunks of it when asked to do it. I can see your point

All 2,500 Television channels are working properly, no problem with the 5,000 radio channels, not much news, the Olympics has been up and running for days all twenty three space craft are working properly and I am not back at Uni until september.

Shortest path is for the travelling salesman problem, this sounds like something different. In any case, I wouldn't use that. Depending on the level of accuracy needed I would use a metaheuristic like a genetic algorithm.

Shortest path is for the travelling salesman problem, this sounds like something different. In any case, I wouldn't use that. Depending on the level of accuracy needed I would use a metaheuristic like a genetic algorithm.

But it works for routing passengers via ferries - given that path costs are time, then you get a overall topology that will show you the fastest way between node A and node B. However, you need to run Dijkstra's for each node in the graph to find the quickest way between any two arbitrary nodes.

SPF algorithms are awesome.

All 2,500 Television channels are working properly, no problem with the 5,000 radio channels, not much news, the Olympics has been up and running for days all twenty three space craft are working properly and I am not back at Uni until september.

Show off!

But it works for routing passengers via ferries - given that path costs are time, then you get a overall topology that will show you the fastest way between node A and node B. However, you need to run Dijkstra's for each node in the graph to find the quickest way between any two arbitrary nodes.

SPF algorithms are awesome.

I think he's trying to calculate journey times for ferry crossings, not the shortest route between a set.