distances $=[$

$[0,10,15,20],$

$[10,0,35,25],$

$[15,35,0,30],$

$[20,25,30,0]$

$]$

num$\_$cities $=$ len$($distances$)$

cost$,$ path $=$ tsp$\_$brute$\_$force$($distances$,$ num$\_$cities$)$

print$($f$"$Minimum cost: $\{$cost$\}")$

print$($f$"$Minimum path: $\{[0]+$ list$($path$)+[0]\}")$