Max Alekseyev
Max Alekseyev
These changes look good to me, but with respect to refactoring, I'd also suggest to change `list` to `tuple` to enable easy hashability. Thanks!
Btw, `X == X.T` correctly evaluates to `False`.
What's going on with this PR?
Then there also should be an easy way to apply an orientation function to the graph and obtain the corresponding directed graph. Something like `D = G.orient(f)`.
Please also include `.random_orientation()` into the proposed harmonization.
> What should be done in `.random_orientation()` ? > We could also consider `strong_orientations_iterator` (which could be renamed `strong_orientations`). I do not know if anything needs to be done. My...
Please include yet another orientation method - `eulerian_orientation()`.