Hello !
D={}
> for t in G:
> D.update({t:[F(t)]})
>
> DiGraph(D)
>
I have several bad answers to give you:
1) There is a bug in what you see, and it is not your fault. Indeed, some
of your points are equal but they have a different hash. This confuses
dictionaries (and graphs).
2) I hope that somebody here will know how to fix this bug, i.e. that two
elements of
'sage.schemes.projective.projective_point.SchemeMorphism_point_projective_field'
which are equal may have different hash (the code given above produces
them). If it is the case it should be done quickly
3) When this will be done, the DiGraph that your code produces (which has
18 vertices, even though the graph may be wrong) will have only 12.
Thus, if you want to do your computations, you will have to define your
graph over a set of *distinct* points. Usually, we use a dictionary that
associates a distinct integer to each of your elements.
This being said, I am sorry to say that this can have messed with your
computations until now, especially if you used dictionaries a lot. The best
you could do is follow this thread and re-run your computations once we
will have a patch ready.
Nathann
--
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.
