https://github.com/afneves/haskellgraphs

A Haskell implementation of classic graph algorithms, including Dijkstra's shortest path and a Traveling Salesman Problem (TSP) solver, developed for the Functional and Logic Programming course at FEUP.

algorithms bit-masking data-structures dijkstra dynamic-programming graph-algorithms haskell memoization shortest-path-algorithm traveling-salesman-problem tsp

Last synced: 11 Oct 2025