# Show that in Dijkstra’s algorithm, for L k there is a path P: 1 → k of length L k .

Chapter 23, PROBLEM SET 23.3 #2

Show that in Dijkstra’s algorithm, for L_{k} there is a path P: 1 → k of length L_{k}.

## 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: