Open
Description
The current diagram shows the mechanics of A* search (g value, h value, f value, etc.) but not some of the concepts in the book:
- Admissible/consistent heuristic. Is it useful to show an inadmissible heuristic so that we would see a non-shortest path computed? I don't know.
- Choice of heuristics. The book mentions absolute and relative error of the heuristic. The smaller the error, the better the time complexity of A*. This could be a diagram that offers the choice of several heuristics, and displays how much of the graph is searched for each choice.
- Contours. When the heuristic is admissible, the f values never decrease, and this creates contours in the graph. The current graph makes it hard to see those contours makes it hard to see but a denser graph could be used to make the contours visible. For example in a 1000-node graph, you could color the nodes with f values between 50 and 60, another color between 60 and 70, another color between 70 and 80, etc. Or maybe lines between those nodes would look better.
These might each be a separate diagram.