Knight-Path 1.0.D018
|
create(void) | solver_taxi | [static] |
factory(const char *name) | solver | [static] |
list_algorithms(void) | solver | [static] |
list_t typedef | solver | |
operator=(const solver_taxi &rhs) | solver_taxi | [private] |
ply(const position &from, const position &to, const list_t &progress) | solver_taxi | [private] |
pointer typedef | solver | |
shortest_solution | solver_taxi | [private] |
solve(const position &from, const position &to) | solver_taxi | [virtual] |
solver() | solver | [protected] |
solver_taxi() | solver_taxi | [private] |
solver_taxi(const solver_taxi &rhs) | solver_taxi | [private] |
~solver() | solver | [virtual] |
~solver_taxi() | solver_taxi | [virtual] |