[1]
B. Anbaroğlu, M. Özkan, A. . Tabakoğlu, and E. G. Uygun, “A Computationally Reproducible Approach to Dijkstra’s Shortest Path Algorithm”, AGE, vol. 2, no. 1, pp. 01–06, Mar. 2022.