No self-introduction
Loading
Profile
Follow
codes (1)
Ant colony algorithm to solve the optimal path problem
no vote
Ant colony algorithm to solve the optimal path problem, C + + implementation, is to find the shortest path, and ant colony algorithm is an approximate algorithm, it is not used to solve the problem of existing accurate and effective algorithm, but to solve the problem that has not found accurate and effective algorithm, such as traveling salesman problem (TSP). Traveling salesman problem can also be said to seek the "shortest path", but it is to seek the minimum Hamiltonian cycle of a complete graph. So far, no polynomial time algorithm has been found for this problem, which belongs to NPC problem
chenange 1 0
1
No more~
Follows0
Fans0