I am trying to do a C++ coding. I am trying to do problem in which i have numbers of points. Now i need to find the path that goes through all the points. This is not actually TSP because as per my knowledge in TSP it is possible to travel from all points to every other points. But in my case the path network is fixed and i just need to find the path that goes through all the points provided that all points may not have connection to every other point..so what algorithm am i supposed to follow.

Recommended Answers

Hey,

Do you mean the Viterbi Algorithm? :s

Jump to Post

All 3 Replies

Have you made an attempt yet? If not, then please do before posting. Also, your question is very hard to understand. I can't tell just what you want from what you've posted, so I don't feel particularly inclined to help you.

Hey,

Do you mean the Viterbi Algorithm? :s

fuzzy logic algorthim

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.