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 | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 156 |
6 | Qingyu | 153 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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