On Monday, December 18, 2017 at 10:40:56 AM UTC, Jori Mäntysalo wrote: > > Using edge_labels=True in canonical_label() of graph seems to work, i.e. > canonization transforms isomorphism to equality. Also the parameter does > *something*, it is not ignored. >
I guess you get lexicographically minimal (or maximal), as a vector, adjacency matrix of the graph. (so labels should be possible to order, not only to compare for equality). > > But what is the meaning of it? For partition-parameter the meaning is > clear (but not clearly documented). > > -- > Jori Mäntysalo > -- 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 https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
