/*
 *
 * Copyright (C) 1999 Frank Dabek (fdabek@mit.edu)
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2, or (at
 * your option) any later version.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
 * USA
 *
 */

#include "bSearchPath.h"

bSearchPath::bSearchPath() {

  SP = 0;
}

void
bSearchPath::addNode(nodeID_t node) {

  stack[SP] = node;
  SP++;
}

nodeID_t
bSearchPath::pop() {
  
  if (SP == 0) return -1;
  SP--;
  return stack[SP];
}

nodeID_t
bSearchPath::lastNode() {

  return stack[SP - 1];
}