On Tuesday, 19 June 2012 03:15:54 UTC+3, Nathann Cohen wrote: > > > yes. If implemented right, an overhead is insignificant. > > O_o > > Are you joking ? O_o >
no, not at all. If you want to ADD edges, that is. It's a case when functional programming does rather well, IMHO. > > > No, you should not be able to apply to a generic graph a function which > only > > works for perfect > > graphs. Otherwise it is asking for trouble. > > I totally agree, only there is *no* function that only works for only one > type of graphs, so it just never happens. hmm, I don't get it. E.g. one can compute the clique number of a perfect graph in polynomial time. Applying this procedure to other graphs won't necessarily give the correct answer. > Volker only said that some methods should be grouped thematically, but all > graphs functions work on all graphs, period. > > 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
