POJ_3984_迷宫问题 DFS

Posted 2021-01-01 naiyoucong

package DFS;

import java.util.Scanner;
//http://poj.org/problem?id=3984
//POJ_3984_迷宫问题
class Mi_gong_wen_ti {
    
    static int k = 18,edge1 = 5,edge2 = 5;
    static boolean[] dp = new boolean[k]; 
    static int[][] maze = new int[edge1][edge2];
    
    void DFSTraverse() {
        for(int i = 0; i < k; i ++) 
            if(dp[i] == false) 
                DFS(i);
    }
    
    void DFS(int i) {
        dp[i] = true;
        for(int j = 0; j < k; j++) {
            if(maze[i][j]==0 && dp[j] == false) {
                System.out.printf("(%d,%d)",i,j);
                DFS(j);
            }
        }
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        for(int i = 0; i < 5; i++)
            for(int j = 0; j < 5; j++)
                maze[i][j] = in.nextInt(); 
    }

}