public static ArrayList<Node2> findPath(Node2[][] network, int startX, int startY, int endX, int endY) {
		for (Node2[] row : network) {
			for (Node2 node : row) {
				node.setSearched(false);
			}
		}
		Node2 start = network[startX][startY];
		Node2 end = network[endX][endY];
		dfs(start, end);
		return path;
	}