#7533: Implement distance graphs
----------------------------+-----------------------------------------------
Reporter: rbeezer | Owner: rlm
Type: enhancement | Status: needs_work
Priority: minor | Milestone: sage-4.3
Component: graph theory | Keywords: distance graph
Work_issues: | Author: Rob Beezer
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Comment(by rbeezer):
Hi Nathann,
Thanks for the excellent suggestions. I'll get a list argument working
and look at using the shortest path routine.
Someplace in the code I got the impression the iterator is faster (by
about a factor of 2).
I've tested the code for digraphs, but really am only interested in
undirected graphs at the moment. With some time, I could easily
generalize it later.
Rob
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7533#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.
