Timeline for Using upper bound information in graph search
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2014 at 1:26 | history | edited | PtH | CC BY-SA 3.0 |
Expanded answer to clarify what is known and not known in the statement of the problem.
|
| Nov 3, 2014 at 10:18 | vote | accept | real | ||
| Nov 3, 2014 at 10:17 | comment | added | real | Thanks Patrick. I didn't think about it. It's a cool idea. I wonder if this is the best use of the upper bound information I have. In your answer, I assume that by dist(neighbour,dest) you mean my_lower_bound(neighbour,dest). | |
| Nov 3, 2014 at 7:55 | history | answered | PtH | CC BY-SA 3.0 |