anyone can give me useful link which contains recursive best first search algorithm pseudo code?
like this (for IDDFS)
thanks for your help
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3741 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3489 |
7 | Radewoosh | 3483 |
8 | Kevin114514 | 3442 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
2 | atcoder_official | 162 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | nor | 150 |
anyone can give me useful link which contains recursive best first search algorithm pseudo code?
like this (for IDDFS)
thanks for your help
Name |
---|
Why do you need a recursive realization of BFS? It seems there is no way to use the recursion stack for performing it: you need a queue as in classical BFS or you have to visits vertices several times as in IDDFS anyway.
do you know what is RBFS?
I didn't say recursive BFS, I said RBFS (Recursive Best First Search) which is heuristic based algorithm
anyway thanks for your unrelated answer, I found one link
In addition to Grevozin's answer, this may provide related info.
deleted