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.
haskell algorithms graph-algorithms data-structures dijkstra dynamic-programming tsp shortest-path-algorithm traveling-salesman-problem bit-masking
-
Updated
Sep 4, 2025 - Haskell