# Show that in Dijkstra’s algorithm, at each instant the demand on storage is light (data for fewer than n edges).

Chapter 23, PROBLEM SET 23.3 #3

Show that in Dijkstra’s algorithm, at each instant the demand on storage is light (data for fewer than n edges).

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

PROBLEM SET 23.2:

PROBLEM SET 23.4:

PROBLEM SET 23.5:

PROBLEM SET 23.6:

PROBLEM SET 23.7:

PROBLEM SET 23.8: