BACKTRACKING STEP Loop to traverse the adjacency list of currPos node and increasing the count by 1 and cost by graph [ currPos , i ] value
for ( int i = 0 ; i < n ; i ++ ) { if ( v [ i ] == false && graph [ currPos ] [ i ] > 0 ) {