#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: David Coudert | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Comment:
Helloooooo !!!
Well, actually this bug has a different source : the "average distance" in
a graph is the sum of the distances between each pair of nodes, divided by
the number of pairs, and of course the "number of pairs" is zero when the
graph has less than 2 vertices. It also seemed like "radius" had no
meaning on empty graphs so I changed it too, but the other ones I checked
were ok `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12244#comment:6>
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.
