Given an undirected graph g, and two vertices v1 and v2 such that there is an edge connecting them, is there a simple way to figure out which one of (v1, v2) or (v2, v1) will be the edge that occurs in g.edges(labels=False)?
-- You received this message because you are subscribed to the Google Groups "sage-support" 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-support. For more options, visit https://groups.google.com/d/optout.
