bluss
Didactically, the existing for loop in the docs is way better. Still, thinking about making examples as clear as possible, also for non-programmers, maybe it could be something like this:...
This is a WIP - does it do the right thing, does the API have the right shape, and so on.
Consider `directed trail` nomenclature? https://en.wikipedia.org/wiki/Path_(graph_theory)
One question I had about this algorithm - not related to uv - if we start at 0, aren't both A, D and A, D, E, F, G valid trails...
@DeliciousHair I think that suggestion changes the algorithmic complexity of the implementation (not that I've analyzed fully), there needs to be some replacement of the O(1) hashmap lookup (could use...
@Peiffap I saw your edit now. I think we say the same thing now, the current algorithm finds only one path from 0 to 1 in this graph:  -...
The existing `all_simple_paths` should also use directed graphs I think, not very familiar with it. It produces all paths between two particular vertices and the new function, now named `all_simple_paths_from`...
User ms on the ndarray zulip endorsed the function as "it's very useful and solid" :slightly_smiling_face:, so it's gotten one review
@DeliciousHair I think that would be helpful
Hi. This looks like a bug - Rye should work even if symlinks are not permitted. Or is it a general write permission error? If it's the former, maybe this...