Opened 4 years ago
Closed 4 years ago
#26663 closed enhancement (fixed)
clean generic_graph.py (part 8) - connectivity
Reported by: | David Coudert | Owned by: | |
---|---|---|---|
Priority: | major | Milestone: | sage-8.5 |
Component: | graph theory | Keywords: | py3, graph |
Cc: | Travis Scrimshaw, Frédéric Chapoton | Merged in: | |
Authors: | David Coudert | Reviewers: | Jori Mäntysalo |
Report Upstream: | N/A | Work issues: | |
Branch: | d16117d (Commits, GitHub, GitLab) | Commit: | d16117deafa1da42b22402891e62d11e9e37a48b |
Dependencies: | Stopgaps: |
Description
Here we clean methods related to connectivity: steiner_tree
, edge_disjoint_spanning_trees
, edge_cut
, vertex_cut
, multiway_cut
, max_cut
, longest_path
, hamiltonian_path
, traveling_salesman_problem
, hamiltonian_cycle
, feedback_vertex_set
, flow
, nowhere_zero_flow
, _ford_fulkerson
, multicommodity_flow
, _build_flow_graph
, disjoint_routed_paths
, edge_disjoint_paths
, vertex_disjoint_paths
, and dominating_set
.
- PEP8 cleaning
- avoid using
.vertices
and.edges
whenever possible, or use.edges(sort=False)
in some cases - in method
longest_path
, add akey=...
to asorted
Change History (5)
comment:1 Changed 4 years ago by
Branch: | → public/26663_generic_graph_part_8_connectivity |
---|---|
Cc: | Travis Scrimshaw Frédéric Chapoton added |
Commit: | → d16117deafa1da42b22402891e62d11e9e37a48b |
Status: | new → needs_review |
Summary: | clean connectivity.pyx (part 8) - connectivity → clean generic_graph.py (part 8) - connectivity |
comment:3 Changed 4 years ago by
Reviewers: | → Jori Mäntysalo |
---|---|
Status: | needs_review → positive_review |
Seems to be OK. Tests passed, can be merged to the newest beta.
comment:5 Changed 4 years ago by
Branch: | public/26663_generic_graph_part_8_connectivity → d16117deafa1da42b22402891e62d11e9e37a48b |
---|---|
Resolution: | → fixed |
Status: | positive_review → closed |
Note: See
TracTickets for help on using
tickets.
New commits:
trac #26663: generic_graph (part 8) - connectivity