-
-
Notifications
You must be signed in to change notification settings - Fork 523
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
Graphs: Faster implementation for HalfCube #30509
Comments
Dependencies: #30329 |
Branch: public/graphs/30509 |
Commit: |
comment:1
To convert the vertices of However, doing so causes an overflow error (not sure why) when we iterate over Last 10 new commits:
|
comment:2
It's of course faster to not call a minor improvement: - G = Graph(E, format='list_of_edges')
+ G = Graph([range(2**(n - 1)), E], format='vertices_and_edges') also, may be it's enough to put the |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Author: Ivo Maffei |
Reviewer: David Coudert |
comment:4
LGTM, and the plots are nice. |
Changed branch from public/graphs/30509 to |
Implementation of a faster method to construct the graph
HalfCube
Depends on #30329
CC: @dimpase @dcoudert
Component: graph theory
Author: Ivo Maffei
Branch/Commit:
898fbee
Reviewer: David Coudert
Issue created by migration from https://trac.sagemath.org/ticket/30509
The text was updated successfully, but these errors were encountered: