Jean-Marie Comets
Jean-Marie Comets
@daiheitan Could you have a look? I added the genericity over `BuildHasher` but I don't see any immediate usages on my side of things.
Hey there! I opened this PR quite some time ago, I wouldn't mind a review both on the motivations of this & the code itself. This was initially an experiment...
I've just rebased the branch and ran the tests. Things could still be improved in terms of docs but the PR is technically ready.
Do you need the full predecessor map, or just the (list of) shortest path(s)? I added something similar for A* in #143, would that API work for you? I'm not...
Could you provide some details on what you mean by "viewing it as an undirected graph"? If you're speaking of an adapter for traversals & other algorithms, then no it...
I'd definitely welcome that! Note that there's quite a few traits that you need to implement for most algorithms to work. I agree that copying `Reversed` is a good start....
Same problem here, I tried @eLod's solution and it worked.
I tried switching to Unite & noticed a pretty substantial increase in CPU usage. I'd be happier if this was fixed :grinning:
Good idea. WIP.
This is close to #8, I'll get this out in a bit.