Which Algorithm, Used To Find The Shortest Path Between Nodes On A Graph, Is Named After The Computer Scientist Who Conceived It In The 1950s While Thinking About How He Might Calculate The Shortest Route Between Rotterdam And Groningen?

🎲 Try a Random Question  |  Total Questions in Quiz: 15073  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Online Quiz League (OQL) Question Bank — practice the complete quiz, review flashcards, or try a random question.

The Online Quiz League (UK) is a well known weekly team quiz league. 


1. Which Algorithm, Used To Find The Shortest Path Between Nodes On A Graph, Is Named After The Computer Scientist Who Conceived It In The 1950s While Thinking About How He Might Calculate The Shortest Route Between Rotterdam And Groningen?