Anyone know C# Code for Travelling Salesman problem?

Question

Please any one help me in getting code to following problem.

Travelling Salesman Problem: Finding Shortest Distance to Visit a set of Cities. Here input is A string array of Cities and An Integer array of Distances between each cities. This is a "Complete Un directed weighted graph" .Please provide code in c# languages>>




Thanks in advance>>>