Find the shortest route Kata in F#

preview_player
Показать описание
In this video, Ian Russell will work through the Find the Shortest Route kata from Trustbit's Transport Tycoon series using F#. You will see how problems like this can be elegantly solved using a functional programming language like F#. In addition to seeing a range of F# features being used including recursion and hierarchical data structures, you will also discover how the compiler and the F# Interactive REPL help to support Ian through the problem towards a solution.

The code and slides are available at: GitHub - ianrussellsoftwarepark/shortest-route-kata
Рекомендации по теме
Комментарии
Автор

awesome content, F# its a beatiful language

felipe-rodriguees
Автор

Why not Dijkstra or any other standard shortest route algorithm?

ujjawalsinha