Ticket #1317 (new enhancement)

Opened 1 year ago

Last modified 4 months ago

graphs: calculate edge and vertex cut-sets

Reported by: jason Assigned to: rlm
Priority: major Milestone: sage-wishlist
Component: graph theory Keywords:
Cc:

Description 

>> * cut-sets (more generally, min/max flow algorithms)

Change History

11/28/2007 12:04:50 PM changed by jason

calculate vertex and edge connectivity is a byproduct of this.

11/29/2007 08:25:20 AM changed by jason

  • summary changed from [graphs] calculate edge and vertex cut-sets to graphs: calculate edge and vertex cut-sets.

12/17/2007 07:20:15 AM changed by rlm

  • keywords deleted.
  • owner changed from mhansen to rlm.
  • component changed from combinatorics to graph theory.

08/26/2008 07:40:12 AM changed by jason

See #3929 for an implementation of this.