Dijkstra's algorithm: Difference between revisions
→{{header|C}}
Line 864:
The priority queue is implemented as a binary heap. The heap stores an index into its data array, so it can quickly update the weight of an item already in it.
=={{header|C}}==
The priority queue is implemented as a binary heap. The heap stores an index into its data array, so it can quickly update the weight of an item already in it.
<lang Cafe>
#include <stdio.h>
| |||