RT @fermatslibrary@twitter.com
Dijkstra Shortest Path algorithm, which finds the shortest path between 2 nodes in a graph, was developed in 1956 in 20 minutes while Dijkstra was relaxing on a café in Amsterdam with his fiancée. His algorithm is still widely used today.