Follow

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.

Sign in to participate in the conversation
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.