#7529: Maximum Average Degree of a graph
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-4.4.2
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by wdj):
* status: needs_review => positive_review
Comment:
This installs fine on 4.4.2.a0, passes sage -testall both before and after
installing glpk (except for unrelated failures).
Also, the docs look good and I tested it on other examples and it works as
claimed:
{{{
sage: g = graphs.RandomGNP(20,.3)
sage: h = graphs.RandomGNP(20,.2)
sage: j = g+h
sage: j.density()
49/390
sage: h.density()
3/19
sage: g.density()
34/95
sage: RR(g.density())
0.357894736842105
sage: RR(h.density())
0.157894736842105
sage: j.maximum_average_degree()
34/5
sage: h.average_degree()
3
sage: g.average_degree()
34/5
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7529#comment:3>
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.
