Yes, Nathan I see, that may also be an issue. However, in looking further
into my particular example, it *shouldn't* be returning that those
projective points are ==. I opened a bug (#17429) and will fix it soon.
On Monday, December 1, 2014 1:54:28 PM UTC-5, Nathann Cohen wrote:
>
> > With that in mind, it seems that DiGraph is fine as those points are
> > differing in both hash and ==, correct?
>
> DiGraphs consider that two points u,v with u==v are the same points.
> If those (equal) points have different hash values, I have no idea of
> what happens (including memory leaks, segfaults, nothing, ...). And it
> happens in your code:
>
> sage: d=DiGraph(D)
> sage: [d.vertices().count(x) for x in d]
> [1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 1]
> sage: len({hash(x) for x in d})
> 18
>
> 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.
