implement automatic graph traversal along shortest path to solution
This commit is contained in:
@ -17,6 +17,7 @@ public:
|
||||
int block_add_x;
|
||||
int block_add_y;
|
||||
|
||||
bool mark_path;
|
||||
bool mark_solutions;
|
||||
bool connect_solutions;
|
||||
|
||||
@ -24,7 +25,7 @@ public:
|
||||
InputHandler(StateManager &_state)
|
||||
: state(_state), hov_x(-1), hov_y(-1), sel_x(0), sel_y(0),
|
||||
has_block_add_xy(false), block_add_x(-1), block_add_y(-1),
|
||||
mark_solutions(false), connect_solutions(false) {}
|
||||
mark_path(false), mark_solutions(false), connect_solutions(false) {}
|
||||
|
||||
InputHandler(const InputHandler ©) = delete;
|
||||
InputHandler &operator=(const InputHandler ©) = delete;
|
||||
|
||||
Reference in New Issue
Block a user