The Dijkstra’s algorithm is of course one of the most well-known and implemented algorithms in GIS. And although I’ve used it and knew in general how it works, I never actually implemented it. Until yesterday evening. After struggling all day with my mail client I had to do something to relax a bit. So I just implemented the Dijkstra’s Algorithm in C#. I’m quite satisified with it. It seems robust and memory friendly. Now I just have to create a network based on OSM data. And to add turntables.