On Dijkstra's Algorithm

Re:On Dijkstra's Algorithm by jgrahamc on Tuesday April 21, 2015 @06:36AM (#9413149)

Before there was Dijkstra's Algorithm there was still need to solve these problems. Here's a talk I gave about computing shortest paths for British Rail in 1955.

https://www.youtube.com/watch?v=pcBJfkE5UwU

[ Parent | on HN ]

Re:On Dijkstra's Algorithm by sjtrny on Tuesday April 21, 2015 @06:43AM (#9413172)

You forgot the link.

[ Parent | on HN ]

Re:On Dijkstra's Algorithm by jgrahamc on Tuesday April 21, 2015 @06:48AM (#9413189)

Oops. Thanks.

[ Parent | on HN ]

Re:On Dijkstra's Algorithm by elwell on Tuesday April 21, 2015 @08:53AM (#9413660)

Link says talk was given in 2012 not 1955.

[ Parent | on HN ]

Re:On Dijkstra's Algorithm by IanCal on Tuesday April 21, 2015 @09:15AM (#9413765)

Assuming this is a serious comment, it's:

Here's a talk I gave (about computing shortest paths for British Rail in 1955).

Rather than

Here's a talk I gave (about computing shortest paths for British Rail) in 1955.

That is, the topic is computing shortest paths in 1955 for British Rail and the talk was given in 2012.

[ Parent | on HN ]

Re:On Dijkstra's Algorithm by zimpenfish on Tuesday April 21, 2015 @12:01PM (#9414955)

I have to admit it gave me momentary pause for "Wow, I didn't think jgrahamc was -that- old".

[ Parent | on HN ]

Re:On Dijkstra's Algorithm by jgrahamc on Tuesday April 21, 2015 @12:21PM (#9415116)

:-) True. 1955 < my_dob

[ Parent | on HN ]

Re:On Dijkstra's Algorithm by elwell on Tuesday April 21, 2015 @02:17PM (#9415901)

Ha, no I was just kidding.

[ Parent | on HN ]