Watch this Author's files
Thanks for the great toolbox.
I'm trying to solve a shortest path problem with A* using an implicit graph.
If I understood correctly, I should add a new vertex and its edges during the call of examine_vertex visitor. I just cant figure it out how to manipulate the graph inside the visitor.
I would be very happy if you could point me an example of using implicit graph with A*. I tried to google it with little success.