New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Reorganize some methods for loops #22911
Comments
This comment has been minimized.
This comment has been minimized.
comment:1
So far I have let both methods and improved the I don't know what's the best option:
Any advice / opinion is welcome. Option 2 is the easiest one, but... New commits:
|
Branch: u/dcoudert/22911 |
Commit: |
comment:2
I would not deprecate the method, but just make Also, while you're moving methods around in the file (something I try to avoid doing because it can create trivial conflicts easily), I would clean up the docstrings
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:4
Should be better now. |
comment:5
Last thing, we should move those doctests from |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:7
I have merged the doctests. Some cases are may be not covered, but I don't know which one. |
Reviewer: Travis Scrimshaw |
comment:8
Hmm...maybe I misparsed the graphs in my mind. Thanks. Just remove the period in the |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:10
Thank you Travis. |
Changed branch from u/dcoudert/22911 to |
We have 2 methods for returning the loops of a (di)graph,
loops
andloop_edges
, and one is faster than the other.Note however that the slower (
loops
) has an extra parameter for edge labels. Let's try to clean that.Component: graph theory
Author: David Coudert
Branch/Commit:
fc65b8c
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/22911
The text was updated successfully, but these errors were encountered: