I'm trying to:

1.

**implement**some binary matrix into distance transform matrix

2.

**calculate**shortest path from a starting point to goal point

3.

**calculate**shortest path considering additional safety from a starting point to goal point

4.

**implement**method that will update cell value only one time to evaluate Distance Transform Matrix (starting from goal cell)

Detailed Explanations can be found here : https://docs.google....jd4U0k5cDQ/edit

I'm using Java Eclipse for this one.

This is what I have compiled so far, but I think it has some errors in it. Help would be greatly appreciated.

public class robotNav { public class builtpath { //implementing the distance transform algorithm final static Integer n = Interger.MAX_VALUE; private int min; final int height; final int width; final int a = 1; final int d = 2; int [ ][ ] grid = { { 100, 100, 100, 100, 100, 100, 100, 0, 0, 0 }, { 100, 100, 100, 100, 100, 100, 100, 100, 100, 100 }, { 0, 0, 0, 0, 100, 100, 100, 100, 100, 100 }, { 100, 100, 100, 0, 100, 100, 100, 100, 100, 100 }, { 100, 100, 100, 0, 100, 100, 100, 0, 100, 100 }, { 100, 100, 100, 100, 100, 100, 100, 0, 100, 100 }, { 100, 100, 100, 100, 100, 100, 100, 0, 100, 100 }, { 100, 100, 100, 100, 100, 100, 100, 0, 100, 100 } }; for(i=1, i++){ } public static void main (String [] args){ } } }