Path algorithms
Dijkstra's algorithm in Cython, part 3/3
Dijkstra's algorithm in Cython, part 3/3 Running time of Dijkstra's algorithm on DIMACS networks with various implementations in Python. This post is the last part of a three-part series: first part second part In the present post, we compare the…
Dijkstra's algorithm in Cython, part 2/3
Dijkstra's algorithm in Cython, part 2/3 This post is the second part of a three-part series. In the first part, we looked at the Cython implementation of Dijkstra's algorithm. In the current post, we are going to compare different priority queue…
Dijkstra's algorithm in Cython, part 1/3
Dijkstra's algorithm in Cython, part 1/3 In this post, we are going to present an implementation of Dijkstra's algorithm in Cython. Dijkstra's algorithm is a shortest path algorithm. It was conceived by Edsger W. Dijkstra in 1956, and published in…
A Cython implementation of a priority queue
A Cython implementation of a priority queue Credit: Musée de l'illusion, Lyon [picture taken by myself] In this post, we describe a basic Cython implementation of a priority queue. A priority…