Usage

1. Kindly follow the Instuctions....

1. Download the input file named "input.txt" in the main.
2. while executing the code,it takes the input file by file handling.

-> file contains following as inputs { no.of.cities, co-ordinates of the respective cities, distances matrix for the cities. }

3. you will be prompted whether to go with the HOP path or not Enter 0 / 1 if '0' is pressed. You will get the output of Rough Mapping, where to go and all. if '1' is pressed. You will get the HOP path (least visits) while travelling from starting_city to the Goal_city."