Analysis of Algorithms course.
Traveling Salesperson Problem with nearest neighbor heuristic. Python greedy algorithm solution to NP-hard problem.
Input Graph is a 2-D adjacency matrix; at each vertex, algorithm chooses smallest edge.
deirdrelk/cs-325-portfolio
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Analysis of Algorithms course. Traveling Salesperson Problem with nearest neighbor heuristic.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published