3 ms·
Thanks for sharing. That looks well done. It has some pathfinding algorithms and the reducer is very neat for traversing the graph. I like that it's based on ma
by rdtsc 3y ago
Thanks for sharing. That looks well done. It has some pathfinding algorithms and the reducer is very neat for traversing the graph. I like that it's based on maps, which could make it more performant than the ets based erlang digraph.