Still no taker for the review ? Maybe I'll end being the one who does it. By the way, do the review include Linear Programming or has it already been done ? Alex
2009/8/27 Nathann Cohen <nathann.co...@gmail.com> > > Hello everybody !!! > > I sent some time ago a few patches in the Graph Theory section that > would really improve Sage's current abilities... And I am looking for > people to review them !! > > The most important are those two patches : > * Vertex Coloring, Edge Coloring ( > http://trac.sagemath.org/sage_trac/ticket/6679 > ) > This patch contains new vertex coloring functions ( MUCH > more efficient than the previous one ) and an edge_coloring function > which is a new feature for Sage. > * Flow, Matching, Connectivity, and some Hard problems ( > http://trac.sagemath.org/sage_trac/ticket/6680 ) > This patch contains : > * 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): > Which makes 9 new functions for Sage's graph library, most > of which are totally fundamental and can be used to build even more > > The others patches are just minor changes, that can wait if nobody has > time to spend on them : > * Small bug in Graph.plot() > * The whole world in a graph > * Kneser Graph in graph_generators > * Random Bipartite Graph > > If you can review the first one, I do thank you in advance... I am > really impatient to see them included in Sage, because the day they > are I will be able to begin to write even more based on these... > Linear Programming brings a lot of new possibilites, but without these > basic functions we cannot go that far (yet) > > Thank youuuuuuuuuuuuuuuuuu for your help :-) > > Nathann > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
