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
pep8 cleaning in centrality_betweenness and centrality_closeness #26822
Comments
Commit: |
Branch: public/26822_centralities |
New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:3
For directed graphs, no value is returned for vertices with out-degree 0, but a value is returned for vertices with in-degree 0 and out-degree > 0. The doctest is now fixed. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:6
This one looks good too. |
Reviewer: Bryan Gin-ge Chen |
Changed branch from public/26822_centralities to |
We also avoid some calls to
.vertices()
that where uselessComponent: graph theory
Author: David Coudert
Branch/Commit:
edd746d
Reviewer: Bryan Gin-ge Chen
Issue created by migration from https://trac.sagemath.org/ticket/26822
The text was updated successfully, but these errors were encountered: