Find the shortest route Kata in F#
Автор: TIMETOACT GROUP Österreich
Загружено: 2022-08-18
Просмотров: 834
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 exercise being worked through can be found at: exercises/transport-tycoon_21.md at master · trustbit/exercises
The code and slides are available at: GitHub - ianrussellsoftwarepark/shortest-route-kata
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
