private void DFS(int[][] graph, boolean[][] visited,int i,int j){
        if(i <0 || j < 0 || i == graph.length || j == graph[i].length)
        {
            return;
            
        }
        visited[i][j] = true;
        if(graph[i][j] == 0){
            return;
        }
        DFS(graph,visited,i,j+1);
        DFS(graph,visited,i+1,j);
        DFS(graph,visited,i+1,j+1);
        DFS(graph,visited,i-1, j+1);
    }
http://www.geeksforgeeks.org/find-number-of-islands/
src/com/interview/graph/NumberOfIsland.java