curr_bound + curr_weight is the actual lower bound for the node that we have arrived on If current lower bound < final_res , we need to explore the node further
if ( curr_bound + curr_weight < final_res ) { curr_path [ level ] = i ; visited [ i ] = true ;