Hello everybody ! There has been some talk of immutable graphs on this mailing list, and even though I wrote the first line of this patch many times -- to stop it all as soon as I begin to think about the vertex-label/edge-label/multiedges/loops hell -- I was wondering what people would be interested in doing with them.... Soooo, which kind of things would you like to compute with such graphs ?
Are you dealing with LARGE graphs (and so want to keep them as small as possible in memory) ? Do you want to iterate over the edges, over a vertex's neibhors ? Do you want to be able to test quickly whether there is an edge between two given vertices ? I'm not asking which kind of things you want to be able to do with those graphs -- all would be possible - but rather which operation you think would be the most expensive... :-) Have fuuuuuuuuuuuuun ! 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
