Create README.md

readme.md

Author: AaryaNale

Traveling_salesman_algorithm/README.md

@@ -0,0 +1,37 @@
+# Traveling Salesman Problem Solver 📬🏃
+
+This Python program solves the Traveling Salesman Problem (TSP), where a salesman needs to find the shortest path to visit a list of cities exactly once and return to the starting city.
+
+## Features
+
+- Create a distance matrix by inputting distances between cities. 🏙⬅🏙
+- Find the shortest path using the brute-force TSP algorithm. 🛣
+- Display the result with city numbers in the path. 📍
+- Menu-driven interface for user interaction. 🔢
+
+## Usage
+
+1. Clone this repository to your local machine:
+
+```git clone https://github.com/your-username/traveling-salesman-solver.git```
+
+
+2. Change the working directory to the project folder:
+
+```cd traveling-salesman-solver```
+
+
+3. Run the program:
+
+```python tsp_solver.py```
+
+
+4. Follow the menu options to create a distance matrix and find the shortest path.
+
+## Requirements
+
+- Python 3.x
+
+## Author
+
+[Aarya Nale](github.com/https://github.com/AaryaNale)