Else part of bfs we discussed yesterday

Elsepart.c

else{ 
  while(!queue.empty()){
    currentPoint = queue.front();
    queue.pop();
    for(int j=0;j<dir.length;j++){
      if(validDir && notVisited){
        Point nextPoint = currentPoint;
        switch (case){
            ...
            default:
            break;
        }
      // before we add the neighbour to the queue, we need to append 
      // the path we followd until now to the neighbour's path attribute 
      neighbourPoint = maze.get(nextPoint.x, nextPoint.y);
      neighbourPoint.path.push_back(currentPoint.path);
      neighborPoint.path.push_back(neighbourPoint);
      // add the neighbour to the queue now
      queue.push_back(neighbourPoint);
      visitedPointSet.add(neighbourPoint);
    }
  }
}