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
int curr_bound = 0 ; Arrays . fill ( curr_path , - 1 ) ; Arrays . fill ( visited , false ) ;