/* Brian O'Connor
 *
 * pursuer.h: data structures for the pursuer problem
 */

#ifndef PURSUER_H
#define PURSUER_H

class EdgeInfo;
class WorldInfo;
class CellInfo;
class VPoly;
class PursuerGraph;
class Cell;
class PGNode;

class PInfo {
public:
  PursuerGraph *pg;    /* graph we search for solution */
  CellInfo *cellInfo;  /* cells for roadmap */
  EdgeInfo *edgeInfo;  /* edges of all obstacles */
  WorldInfo *wInfo;    /* obstacles in point form */
  int nSteps;          /* # of steps in solution */
  PGNode **sln;        /* cells we traverse for solution */
};

#endif