> Sounds good. If I have a code like > > L=function_that_should_return_edges_without_repetitions() > G=Graph(L) > > I would like to see if L actually contained multiedges because of a bug in > previous function.
Do you mean that you would like this code to raise an exception ? I am not a big fan of that, for several reasons: 1) Right now, if you add an edge several times in a simple graph, the edge is added the first time and the other calls do nothing 2) g.add_edges([(0,1),(0,1),(0,1)]) works the same way, and adds only one edge when the graph is simple What I wanted to do with my ticket is reach the state where "A Graph is simple unless specified otherwise" (as in all books you will find in the subject). This would mean that Graph(a_list_of_edges_with_possible_repetitions) would always return a simple graph. Exactly as if you did g = Graph() g.add_edges(a_list_of_edges_with_possible_repetitions) As, currently, Graph(a_list_of_edges_with_possible_repetitions) will sometimes return a mutigraph, I wanted to deprecate this behaviour by adding a warning "Be careful, if you want a multigraph you MUST say it explicitly". I need your opinion on that, and also your help to review the ticket. It is almost one year old, and this deprecation will delay for one year some other improvements in the graph constructor. Nathann -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
