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
clean generic_graph.py (part 9) - edge and vertex handlers #26666
Comments
Commit: |
New commits:
|
comment:2
2 trivial failing doctests in src/sage/graphs/bipartite_graph.py |
comment:4
oups, fixed. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:7
We also avoid sorting vertices before removing them from the graph. |
comment:8
Just for clarity, I think it is better to add these parentheses: Since -Delete all edges from `u` to `v`.
+Delete all edges from ``u`` to ``v``. I think the Other than that LGTM. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:10
i have implemented all you comments. Should be better now. |
Reviewer: Travis Scrimshaw |
comment:11
Thanks. LGTM. |
Changed branch from public/26666_generic_graph_part_9_edge_and_vertex to |
In this ticket, we clean methods for adding/removing vertices/edges and enumerating neighbors. The main changes are:
sort
to method.vertices
. This gives an alternative tolist(G)
.delete_vertices
, we add as first instructionvertices = list(vertices)
. This way we now allow to call this method with an iterator. Before, the method was not removing any vertex when called with an iterator. This will certainly help reducing further the number of calls to.vertices()
.vertex_iterator
, we remove doctests related to former networkx backendremove_multiple_edges
that should make it fasterCC: @tscrim @fchapoton
Component: graph theory
Author: David Coudert
Branch/Commit:
1c43e4e
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/26666
The text was updated successfully, but these errors were encountered: