I don't think the names you're suggesting are any more natural or easy to find. I rather like successors and predecessors -- though I'd name them "parents" and "children", myself.
On Sat, Oct 3, 2009 at 2:47 AM, Nathann Cohen <nathann.co...@gmail.com> wrote: > Hello everybody !!!! > > I thought odd, a few days ago when writing some script dealing with > DiGraphs, that Sage had no methods to list out_neighbors and in_neighbors of > a graph. I used the functions outgoing_edges and incoming_edges to find > them, but still... > When trying to write a patch for that, I noticed there were functions for > this already ! > DiGraph.successors() > DiGraph.predecessors() > > Well. I think those two functions should be renamed..... I think > DiGraph.out_neighbors() and DiGraph.in_neighbors() would be much easier to > find and more natural... > > ( At the same time, I think it's be good to rename outgoing_edges to > out_edges and incoming_edges to in_edges ) > > What do you think about it ? > > 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 -~----------~----~----~----~------~----~------~--~---
