****Please Help***** How to Solve Travelling Salesman Problem using Branch and Bound????
Link:https://www.techiedelight.com/travelling-salesman-problem-using-branch-and-bound/
********But my question is how to solve this problem without using structure?????? *******
What exactly do you mean by "without using structure"?
struct Node { // stores edges of the state-space tree // help in tracing the path when the answer is found vector<pair<int, int>> path;
};
How to modify this part??
I don't understand. What do you want to modify in there?