#12244: Empty graphs and new distance computations
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author: Nathann Cohen
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: new => needs_review
Old description:
> This method fixes a "problem" with empty graphs when fed to the new
> distances computation methods added in #12052.
>
> The cases "n == 0" are avoided, and some flags are added so that the
> exceptions are indeed forwarded by the C methods. They were not, which is
> the reason why it was not found before `:-p`
>
> Nathann
New description:
This patch fixes a "problem" with empty graphs when fed to the new
distances computation methods added in #12052.
The cases "n == 0" are avoided, and some flags are added so that the
exceptions are indeed forwarded by the C methods. They were not, which is
the reason why it was not found before `:-p`
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12244#comment:1>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
