Computer scienceAlgorithms and data structuresAlgorithmsGraph algorithmsShortest path algorithms

Comparing the shortest path algorithms

Lee's algorithm

Report a typo

Which of the following statements about Lee's algorithm are correct? Lee's algorithm:

Select one or more options from the list

solves the all-pairs shortest path problem.

works faster on sparse graphs.

returns not only the weights but also the shortest paths themselves.

requires large memory.

Create a free account to access the full topic