A-star algorithm for traveling salesman problem
2016-08-23
1 0 0
no vote
Other
Earn points
In the traveling salesman problem (TSP) implemented by A-star algorithm, for a node in the state space graph, if its successor node is found, the node is expanded, and the node that has not found its successor node is called unexpanded node. The unexpanded nodes are stored in a table named open, while the extended nodes are stored in a table named closed.
c++
算法
实现
问题
旅行
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
No comment