#7533: Implement distance graphs
----------------------------+-----------------------------------------------
Reporter: rbeezer | Owner: rlm
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-4.3
Component: graph theory | Keywords: distance graph
Work_issues: | Author: Rob Beezer
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Changes (by rbeezer):
* status: needs_work => needs_review
Comment:
New patch addresses two of Nathann's suggestions.
1. A list of distances, or a single distance, are now possible. New
doctests illustrate this and aslo show how to build the graph with all the
distances *less than or equal* to a specified value.
2. Using {{{shortest_path_all_pairs()}}} turns out, surprisingly, to be
much slower. It added about 37 seconds to running the tests for the file
(from 80 seconds to 117 seconds). For the odd graph with parameter 5 (on
126 vertices), the "all pair" version took about 20 seconds while the
version in the current patch (which uses {{{.distance()}}}) takes a bit
over 2 seconds.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7533#comment:4>
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.
