Trying To Find Cheapest Path Recursively

Trying to find cheapest path recursively, given a grid a integers trying to recursively find the cheapest path from the top to the bottom. cheapest being the sum of the path. I think I've made my code over complicated. recursive things are usually much more elegant

import java.io.FileInputStream; 
import java.util.Scanner;
import java.io.FileInputStream;
import java.io.FileNotFoundException; 
public class trial {
public void readFile(String fileName)
 
[Code] ....

and here is the grid

27 19 18 85 32 11 18 24 22 98
60 83 52 61 18 64 74 33 95 42
56 27 71 56 65 70 18 78 35 74
15 89 19 92 61 76 92 42 57 26
88 28 78 45 21 98 11 72 82 97
49 54 88 79 16 43 27 78 52 71
17 18 60 40 72 39 70 52 96 11 
62 79 25 50 73 40 98 64 44 72
25 79 72 25 64 35 29 16 77 96 
12 93 49 64 61 34 83 87 34 36