Skip to content
/ A_star_TSP_MST Public

A* star search algorithm implemented in Python to solve Travelling Salesman Problem using MST Heurisitcs

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

Anshumaan-Chauhan02/A_star_TSP_MST

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits

README.md

README.md

 
 

tsp_solver.py

tsp_solver.py

 
 

Repository files navigation

A_star_TSP_MST

A* star search algorithm implemented in Python to solve Travelling Salesman Problem using Minimal Spanning Heurisitcs. We get the MST heuristics by solving the relaxed TSP problem, now the cost obtained - is an admissible and consistent heuristics for the original problem.




Anurag’s github stats Top Langs

About

A* star search algorithm implemented in Python to solve Travelling Salesman Problem using MST Heurisitcs

Topics

python astar-algorithm heuristic-search-algorithms travelling-salesman-problem minimal-spanning-tree

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages