Well, the first thing I tried was (i-j)^2 == 1. ;-) Partially answering my own question, by reading the code (graphs/graph.py):
from itertools import combinations self.add_vertices(verts) self.add_edges(e for e in combinations(verts,2) if f(*e)) self.add_edges((v,v) for v in verts if f(v,v)) The "combinations()" iterator appears to produce unordered pairs, as you would expect (and "f" is the supplied function). So should the "edge-detection" function be required to return true for any pair of vertices joined by an edge, or should there be an edge constructed between any pair of vertices for which the edge-detection function returns true? I'd argue the former requires some help with the documentation, while the latter would be a change to the code/behavior. Rob -- 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 sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
