#6680: [with patch, needs review] Flow, Matching, Connectivity, and some Hard
problems
----------------------------+-----------------------------------------------
   Reporter:  ncohen        |       Owner:  rlm         
       Type:  enhancement   |      Status:  needs_review
   Priority:  major         |   Milestone:  sage-4.2.1  
  Component:  graph theory  |    Keywords:              
Work_issues:                |      Author:              
   Reviewer:                |      Merged:              
----------------------------+-----------------------------------------------
Description changed by ncohen:

Old description:

> Hello everybody !!!
>
> Here are several new functions for the Graph class in Sage :
>     * def min_dominating_set(g, value_only=False,log=0):
>     * def min_independent_dominating_set(g, value_only=False,log=0):
>     * def min_vertex_cover(g,value_only=False,log=0):
>     * def max_matching(g,value_only=False, use_edge_labels=True):
>     * def max_flow(g,x,y,value_only=True,integer=False,
> use_edge_labels=True):
>     * def min_edge_cut(g,s,t,value_only=True,use_edge_labels=True):
>     * def min_vertex_cut(g,s,t,value_only=True):
>     * def edge_connectivity(g,value_only=True,use_edge_labels=True):
>     * def vertex_connectivity(g,value_only=True):
>
> Those new functions all use Linear programming, so to use them you will
> have to install GLPK ( see ticket #7049 )

New description:

 Hello everybody !!!

 Here are several new functions for the Graph class in Sage :
     * def min_dominating_set(g, value_only=False,log=0):
     * def min_independent_dominating_set(g, value_only=False,log=0):
     * def min_vertex_cover(g,value_only=False,log=0):
     * def max_matching(g,value_only=False, use_edge_labels=True):
     * def max_flow(g,x,y,value_only=True,integer=False,
 use_edge_labels=True):
     * def min_edge_cut(g,s,t,value_only=True,use_edge_labels=True):
     * def min_vertex_cut(g,s,t,value_only=True):
     * def edge_connectivity(g,value_only=True,use_edge_labels=True):
     * def vertex_connectivity(g,value_only=True):

 If you have no LP Solver installed, you can download GLPK or CBC from this
 address : http://www.sagemath.org/packages/optional/

--

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6680#comment:12>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to 
[email protected]
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---

Reply via email to