DFS(미로찾기) class Graph { private int[][] adjMat; private Vertex[] vertices; private int numVertices; public Graph(int max) { adjMat = new int[max][max]; vertices = new Vertex[max]; numVertices = 0; for (int i = 0; i 프로그래밍/알고리즘 2017.02.24
