When did Dijkstra solve the shortest path problem?
1954
1956
1958
1960
Answer
In 1956, Edsger W. Dijkstra, a Dutch computer scientist, solved the shortest path problem, which involves finding the shortest path between two points in a graph. Dijkstra's algorithm, known as the Dijkstra's algorithm, provides an efficient method for solving this problem. It works by iteratively updating the distances to each node in the graph, starting from the source node, until the destination node is reached.
Edsger W. Dijkstra Mastermind Quiz: 31 Questions for the ultimate fans
Subscribe Now!
Learn something
new everyday
Playing quizzes is free! We send 1 quiz every week to your inbox