cs170-final-proj

CS170-final-proj: 3-colored Traveling Salesman Problem. Used simulated annealing on a random but random spanning tree of the graph.

Name		Name	Last commit message	Last commit date
Latest commit History 23 Commits
instances		instances
1		1
2		2
3		3
4		4
5		5
6		6
BCGW1.in		BCGW1.in
BCGW2.in		BCGW2.in
BCGW3.in		BCGW3.in
Final_Project.pdf		Final_Project.pdf
README		README
README.md		README.md
answer1.out		answer1.out
answer2.out		answer2.out
answer3.out		answer3.out
answer4.out		answer4.out
answer5.out		answer5.out
answer6.out		answer6.out
scorer_single.py		scorer_single.py
test1.py		test1.py
test2.py		test2.py
test3.py		test3.py
test4.py		test4.py
test5.py		test5.py
test6.py		test6.py
validator.py		validator.py

Provide feedback