Publication at Faculty of Mathematics and Physics |
2005
Abstract
In this paper for high school students and teachers, we explain the data structure called heap and show its application in Dijkstra's algorithm for the shortest path problem.
In this paper for high school students and teachers, we explain the data structure called heap and show its application in Dijkstra's algorithm for the shortest path problem.