Calculate initial lower bound for the root node using the formula 1 / 2 * ( sum of first min + second min ) for all edges . Also initialize the curr_path and visited array
curr_bound = 0 NEW_LINE curr_path = [ - 1 ] * ( N + 1 ) NEW_LINE visited = [ False ] * N NEW_LINE