pushStack(q, start);
      while (q->head != NULL)
      {
            prev_node[k] = v;
            v = topStack(q);
            popStack(q);
            if(v == end)
            break;
            visitedarray[v] = 1;
            for (int i = 1; i <= n; i++)
            {
                  if (map[v][i] && !visitedarray[i])
                        pushStack(q, i);
            }
      }
      for(i = 1; i <= k; i++)
      {
            printf("%d\n", prev_node[i]);
      }