Built using Hugo and ksucs-hugo-theme.
In this chapter, we introduce heaps and implement them using priority queues. We will also look at Dijkstra’s algorithm for finding the shortest path in a graph.