Quiz: Shortest Paths

Quiz yourself on shortest path algorithms.

Quiz: Shortest path algorithms

1

You want to solve the ASSP problem in a dense weighted graph. Which algorithm has a better worst-case runtime?

A)

Dijkstra

B)

Floyd-Warshall

C)

A and B have the same complexity.

Question 1 of 30 attempted

Get hands-on with 1200+ tech skills courses.