> But anyway, why a hash table? In C++, to build these graph structures we > are talking about, I only use B-Tree based structures, for which we only > need to have an order (actually a weak ordering), and an order on pairs of > integers is something simple to compute;
Yeah. But we have labels to deal with. Remove vertex and edge labels from Graphs and you will not recognize the running time :-P Nathann -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To post to this group, send email to sage-devel@googlegroups.com. To unsubscribe from this group, send email to sage-devel+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en.
