Алгоритм поиска пути в лабиринте, заданном связным графом

int mas[24][24] = { {0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,},
{0,1,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,},
{0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,},
{0,1,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,},
{0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,},
{0,1,0,0,0,0,1,0,1,0,0,0,0,1,0,0,0,0,0,0,},
{0,2,1,1,1,1,1,2,0,0,0,0,0,1,0,0,0,0,0,0,},
{0,1,0,0,0,0,1,1,0,0,0,0,0,1,0,0,0,0,0,0,},
{0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,},
{0,1,0,0,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,},
{0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,},
{0,1,1,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,},
{0,2,1,1,1,1,1,2,0,0,0,0,0,2,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,}};
int s1 = 0;
int s2 = 1;
mas[s1][s2] = 2; do
{
  for (int i = 0; i < 24; i++) 
  {
   for (int j = 0; j < 20; j++)
   {
       HANDLE Color1 = GetStdHandle(STD_OUTPUT_HANDLE);
        SetConsoleTextAttribute(Color1,FOREGROUND_GREEN | FOREGROUND_INTENSITY);
    if (mas[i][j] == 1)
    {
     cout << static_cast<char>(178);
     cout << static_cast<char>(178);
    }
    if (mas[i][j] == 0)
    {
      cout << "  ";
    }
        HANDLE Color2 = GetStdHandle(STD_OUTPUT_HANDLE);
        SetConsoleTextAttribute(Color2,FOREGROUND_RED | FOREGROUND_INTENSITY);
    if (mas[i][j] == 2)
    {
      cout << static_cast<char>(219);
      cout << static_cast<char>(219);
    }
   }
   cout << endl;
  }
  cin.get();
} while(true);