Adjacency matrix for the given graph
int adj [ N ] [ N ] = { { 0 , 10 , 15 , 20 } , { 10 , 0 , 35 , 25 } , { 15 , 35 , 0 , 30 } , { 20 , 25 , 30 , 0 } } ; TSP ( adj ) ; printf ( " Minimum ▁ cost ▁ : ▁ % d STRNEWLINE " , final_res ) ; printf ( " Path ▁ Taken ▁ : ▁ " ) ; for ( int i = 0 ; i <= N ; i ++ ) printf ( " % d ▁ " , final_path [ i ] ) ; return 0 ; }