It's not a bug, it's how equality is defined (they have the same settings
for loops, multiedges and weightedness). It's different from being
isomorphic.
def __eq__(self, other):
"""
Compare self and other for equality.
Do not call this method directly. That is, for ``G.__eq__(H)``
write ``G == H``.
Two graphs are considered equal if the following hold:
- they are either both directed, or both undirected;
- they have the same settings for loops, multiedges, and
weightedness;
- they have the same set of vertices;
- they have the same (multi)set of arrows/edges, where labels
of arrows/edges are taken into account if *and only if*
the graphs are considered weighted. See
:meth:`~GenericGraph.weighted`.
Le mercredi 30 août 2017 01:25:29 UTC+2, David Roe a écrit :
>
> I would say this is a bug....
> David
>
>
--
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.
