I have an actual use-case for this: 
[https://gist.github.com/b3liever/92e9cb286aeb0a18d6f9ff72813d0f63](https://gist.github.com/b3liever/92e9cb286aeb0a18d6f9ff72813d0f63)
 its bfs search using a table to map a node to index of its parent. Original is 
from a rust project: 
[https://github.com/samueltardieu/pathfinding/blob/master/src/directed/bfs.rs](https://github.com/samueltardieu/pathfinding/blob/master/src/directed/bfs.rs)
 Of course my table hack doesn't work when a resize happens because all the 
indexes are invalided. Is there a better way to do this?

Reply via email to