Skip to content

arifterzioglu/Nearest-Neighbour-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Nearest-Neighbour-Algorithm

Nearest Neighbour Algorithm TSP Problem

IE 400 Principles of Engineering Management

Group Members:

Özgür Can Erdoğan-21300586

Barış Gündoğan-21300797

Arif Can Terzioğlu-21302061

Euclidian and Non-Euclidian samples have been generated on Matlab.

Symmetric and Non-symmetric samples have been produced on C#. Nearest neighbor algorithm has been also implemented on C# environment.

Inputs:

Modal takes inputs in an array form separated by comma.

Exp:

0,12,88,46,12,

12,0,28,10,58,

88,28,0,94,54,

46,10,94,0,36,

12,58,54,36,0

Nearest neighbour takes inputs in a txt file. Each number is separated by one tab space. Location of the file must be given to the

console program.

Exp:

0 12 88 46 12

12 0 28 10 58

88 28 0 94 54

46 10 94 0 36

12 58 54 36 0

About

Nearest Neighbour Algorithm TSP Problem

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages