To whom it may concern:
I have a homework assignment that requires a backtracking algorithm to find the minimum cost route from one starting city to all the other cities along the route and then back to the starting city. It requires that I use a bounding function to reduce the search space. I'm not really clear on what the bounding function is supposed to do. I know that it is supposed to "kill the live node" and reduce search space some how. I'm just not clear how. I would just appreciate any simplified explanation of how this function works so that I can try to write the code for it.