The Haskell Unfolder Episode 20: Dijkstra's shortest paths
In this (beginner-friendly) episode, we will use Dijkstra's shortest paths algorithm as an example of how one can go about implementing an algorithm given in imperative pseudo-code in idiomatic Haskell. We will focus on readability, not on performance.
![](https://kbin.social/media/cache/resolve/entry_thumb/f9/54/f954ce96e9b7d9ccb6c043afe1de6a91177ac4403b2cc4eb741c82db6044db72.jpg)
Add comment