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
Avoid comparison of vertex labels in MIP (Step 2) #26282
Comments
Commit: |
New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:4
I change
|
comment:6
I think you can get rid of
as they are not simplifying the code (or changing the readability IMO. I would still use - g_mad = g.subgraph([v for v,l in six.iteritems(p.get_values(d)) if l>m ])
+ d_val = p.get_values(d)
+ g_mad = g.subgraph([v for v,l in d_val.items() if l > m ]) In general, I don't get the point of that change. More standard convention and faster: -lists = dict((v, []) for v in self)
+lists = {v: [] for v in self}
|
comment:8
I have implemented all your comments. |
comment:9
Thanks. LGTM. |
Reviewer: Travis Scrimshaw |
comment:10
Thank you ! |
Changed branch from public/26282_avoid_comparison_of_vertex_labels to |
Avoid comparison of vertex labels in
graph.py
.CC: @tscrim @fchapoton
Component: graph theory
Author: David Coudert
Branch/Commit:
6acb781
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/26282
The text was updated successfully, but these errors were encountered: