Opened 8 years ago
Closed 5 years ago
#1317 closed enhancement (duplicate)
graphs: calculate edge and vertex cut-sets
Reported by: | jason | Owned by: | rlm |
---|---|---|---|
Priority: | major | Milestone: | sage-duplicate/invalid/wontfix |
Component: | graph theory | Keywords: | |
Cc: | mvngu | Merged in: | |
Authors: | Reviewers: | ||
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description
>> * cut-sets (more generally, min/max flow algorithms)
Change History (9)
comment:1 Changed 8 years ago by jason
comment:2 Changed 8 years ago by jason
- Summary changed from [graphs] calculate edge and vertex cut-sets to graphs: calculate edge and vertex cut-sets
comment:3 Changed 8 years ago by rlm
- Component changed from combinatorics to graph theory
- Keywords graphs removed
- Owner changed from mhansen to rlm
comment:4 Changed 7 years ago by jason
See #3929 for an implementation of this.
comment:6 Changed 6 years ago by ncohen
see #6680
comment:7 Changed 5 years ago by ncohen
- Report Upstream set to N/A
- Status changed from new to needs_info
Already available. Do we let it stay because the current implementation requires optional packages, or do we agree on saying it's fine for the moment ? :-)
comment:8 Changed 5 years ago by jason
I'd say this could be closed. Eventually we should figure out how to make it a standard part of Sage, but on another ticket.
comment:9 Changed 5 years ago by ncohen
- Milestone changed from sage-wishlist to sage-duplicate/invalid/wontfix
- Resolution set to duplicate
- Status changed from needs_info to closed
Note: See
TracTickets for help on using
tickets.
calculate vertex and edge connectivity is a byproduct of this.