blob: bcff452ab5c34c3849f4410f8bc87ba37aaa8a7e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#ifndef ASTAR_HPP
#define ASTAR_HPP
#include "priority_queue.hpp"
#include "node.hpp"
#include <ostream>
// defines the number of nodes one can go to
// we don't need this as we will have the queues
//#define NEIGHBOUR_NUM 4
// TODO add constructors and functions to calculate heuristics etc..
class AStar {
public:
AStar();
private:
PriorityQueue<Node> open_set;
Node current;
};
#endif // ASTAR_HPP
|
