-
Notifications
You must be signed in to change notification settings - Fork 132
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
Combinatorics: fix degree(::Graph) docu #4441
base: master
Are you sure you want to change the base?
Conversation
Could somebody from the polymake team please check whether the changes are okay? If not, feel free to push changes to the branch. Many thanks in advance! |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The docstring states If the graph is directed, the neighbors reachable via outgoing edges are returned.
, so the current behaviour of neighbors
is as documented.
Maybe @benlorenz or @lkastner have some opinion on this?
Sorry for the confusion. My comment was about the function |
Okay, I think I got confused. The Should we |
The docstring for The neighbors function does match what julia Graphs.jl does: https://juliagraphs.org/Graphs.jl/v1.5/core/#Graphs.neighbors-Tuple{AbstractGraph,%20Integer} (defaulting to In any case these are decisions that were made and it is not a clear bugfix. So we cannot change that behavior until 2.0. Edit: We do also have |
Okay, I've changed the commit. It now only adds a comment to the docu of |
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## master #4441 +/- ##
==========================================
- Coverage 84.39% 84.36% -0.04%
==========================================
Files 663 663
Lines 87938 87938
==========================================
- Hits 74214 74187 -27
- Misses 13724 13751 +27
|
Addresses #4440