Graph optimization project implementing MST construction, heuristic TSP, and optimal TSP using branch-and-bound. Live demo shows algorithm behavior on representative test cases.
C++GraphsMSTTSPBranch and BoundAlgorithms
Source code is not publicly available due to University of Michigan academic integrity policy.
You can still explore the behavior via the live demo.