Implemented MST algorithms, tested various heuristics for approximating TSP, wrote a branch-and-bound algorithm which found the optimal path. This was super satisfying to finally get it to work.
If you are an employer, I can request to publish code samples with the explicit permission of the University, that's why I don't have a Github repo link for this project.
