Test out your understanding of shortest path algorithms in our quiz!
0 of 5 Questions completed
Questions:
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
0 of 5 Questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
What would the shortest path look like from A to G?
(Type in the nodes in capitals & separated by a comma)
Why might Dijkstra’s algorithm not be suitable for use with a national satellite navigation system?
What is an intractable problem?
Where might we find an example of an intractable problem?
What would the shortest path look like from A to G?
(Type in the nodes in capitals & separated by a comma)