#18906: Refactor min spanning tree
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.8
Component: graph theory | Resolution:
Keywords: Minimum spanning | Merged in:
tree | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | ace2f0d33337f08537a27b3b6cba8aff01b93576
u/borassi/refactor_min_spanning_tree| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by dcoudert):
I like this patch, and I didn't know that it had bugs.
Wouldn't it be nicer if edges were sorted (including end-vertices) ? You
could use e.g. `sorted( (u,v,l) if u<v else (v,u,l) for u,v,l in edges )`.
It adds some computation time, but that would give an additional value
(i.e., we can assume that...). In fact, I assume that some algorithms are
already doing it. For others, it might be sufficient to add a test before
inserting in list `edges`.
--
Ticket URL: <http://trac.sagemath.org/ticket/18906#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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
