#include <iostream>

#include "Graph.h"
#include "Hash.h"
#include "Maze.h"

#include "test_utilities.h"

// Given a Maze m and a vertex id v, return 0 if there is no path
// from vertex v to m.get_end_vertex().  Otherwise return 1 and
// call m.set_text_at(i,j,'#') for each location (i,j) of each
// vertex on a path from v to m.get_end_vertex().

bool find_and_mark_path(Maze &m, int v, HashTable<int,bool> & visited) {

  //////////////////////////////// YOUR CODE HERE.

  return 0;
}

int main()
{
    Maze m;
    
    // read the maze in text format from stdin
    std::cin >> m;

    HashTable<int,bool> visited(0);

    if (find_and_mark_path(m, m.get_start_vertex(), visited))
      // write the maze, with the path marked, in text format on stdout
      std::cout << m;
    else
      std::cout << "NO PATH" << std::endl;
}