4 ms·
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
by jgrahamc 12y ago
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 https://www.youtube.com/watch?v=pcBJfkE5UwU
- sjtrny 12y agoYou forgot the link.
- jgrahamc 12y agoOops. Thanks.
- elwell 12y agoLink says talk was given in 2012 not 1955.
- IanCal 12y agoAssuming 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.
- zimpenfish 12y agoI have to admit it gave me momentary pause for "Wow, I didn't think jgrahamc was -that- old".
- jgrahamc 12y ago:-) True. 1955 < my_dob
- elwell 12y agoHa, no I was just kidding.