Hello everybody !! I am writing about two tickets in Graph Theory that really need reviews... They have been standing there for some time (something like 3 months !!!), and I wouldn't mind so much if it was not for the fact that these two tickets contains very fundamental functions that block the implementation of many others ones...
Flow, Matching, Connectivity, and some Hard problems ----------------------------------------------------------------------------------- URL : http://trac.sagemath.org/sage_trac/ticket/6680 Contents : Minimum dominating Set Minimum Independent Dominating Set Minimum Vertex Cover Maximum weighted matching Maximum Flow Minimum Edge cut Minimum Vertex Cut Edge Connectivity Vertex Connectivity Vertex Coloring, Edge Coloring ---------------------------------------------------------------------------------- URL : http://trac.sagemath.org/sage_trac/ticket/6679 Contents : Vertex Coloring Edge Coloring All these functions are documented and explained, first because the user could be interested in them, but also to ease reviews. I also tried to add comments to the code when necessary. If you have some time to review them, please help the Graph Theory section of Sage :-) 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 URL: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
