Node.cpp

   1 #include "Node.h"
   2
   3 // Number of cells the node is away from the end cell of the map.
   4 int heuristic;
   5 int row;
   6 int column;
   7 int id;
   8 bool traversable;
   9
  10 Node::Node()
  11 {
  12         id = -1;
  13         heuristic = -1;
  14         row = -1;
  15         column = -1;
  16         traversable = false;
  17 }
  18
  19 Node::Node(int newId, int newRow, int newColumn) : id(newId), row(newRow), column(newColumn)
  20 {
  21         heuristic = -1;
  22         traversable = false;
  23 }
  24
  25 Node::Node(int newId, int newRow, int newColumn, int newHeuristic, bool newTraversable) : id(newId), row(newRow), column(newColumn), heuristic(newHeuristic), traversable(newTraversable) { }
  26
  27 void Node::setHeuristic(int newHeuristic)
  28 {
  29         heuristic = newHeuristic;
  30 }
  31
  32 void Node::setId(int newId)
  33 {
  34         id = newId;
  35 }
  36
  37 void Node::setRow(int newRow)
  38 {
  39         row = newRow;
  40 }
  41
  42 void Node::setColumn(int newColumn)
  43 {
  44         column = newColumn;
  45 }
  46
  47 void Node::setTraversable(bool newTraversable)
  48 {
  49         traversable = newTraversable;
  50 }
  51
  52 int Node::getHeuristic()
  53 {
  54         return heuristic;
  55 }
  56
  57 int Node::getId()
  58 {
  59         return id;
  60 }
  61
  62 int Node::getRow()
  63 {
  64         return row;
  65 }
  66
  67 int Node::getColumn()
  68 {
  69         return column;
  70 }
  71
  72 bool Node::getTraversable()
  73 {
  74         return traversable;
  75 }