#15060: The empty graph once again
-------------------------------------------------+-------------------------
Reporter: darij | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-5.12
Component: combinatorics | Resolution:
Keywords: graphs, border cases, bitset, | Merged in:
memleak | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Comment (by kcrisman):
> Does it ? Well, what do you think of this "WeHaveNoIdeaException" ? Do
you think it's not a good way out ?
No, that seems silly to me. We should just pick a definition. But you
could ask on sage-devel - I'm sure this comes up elsewhere (disagreement
about definitions).
> Yepyep, it can be fixed with a `if G.order() == 0`.
I suspected as much.
> > After all, changing this could also lead to unintended consequences in
other code that assumed implicitly that this worked.
> Or that assumed incorrectly that it worked and gave the other answer
`:-P`
I meant within the Sage library, but yes, that too.
--
Ticket URL: <http://trac.sagemath.org/ticket/15060#comment:13>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" 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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
