this post was submitted on 21 Feb 2024
2 points (100.0% liked)

Haskell

65 readers
3 users here now

**The Haskell programming language community.** Daily news and info about all things Haskell related: practical stuff, theory, types, libraries, jobs, patches, releases, events and conferences and more... ### Links - Get Started with Haskell

founded 1 year ago
2
The Haskell Unfolder Episode 20: Dijkstra's shortest paths (well-typed.com)
submitted 8 months ago by [email protected] to c/[email protected]
0 comments fedilink hide all child comments
 

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.

no comments (yet)
sorted by: hot top controversial new old
there doesn't seem to be anything here