A recursive function to find the shortest path from source ' s ' to destination ' d ' . This function returns the smallest possible cost to reach station N - 1 from station 0.
static int minCost ( int cost [ ] [ ] ) {