Introduction - If you have any usage issues, please Google them yourself
This file contains my project from Algorithm class on Traveling Salesman Problem. It implements some branch and bound methods to increase it s performance. In the main function you can find that I use Drzewo() function Drzewoopt() functins stand for optimal search using sorted city tabel. Each Drzewo() function represents diffrent way to cut off non optimal solutions with increasing effectivity